Báo cáo toán học: "On k-Ordered Bipartite Graphs" potx

Ngày tải lên: 07/08/2014, 06:20

Ngày tải lên: 05/08/2014, 15:20

Ngày tải lên: 07/08/2014, 08:20

Ngày tải lên: 08/08/2014, 01:20

... part 1 of the lemma holds. On the number of perfect matchings and Hamilton cycles in -regular non -bipartite graphs Alan Frieze ∗ Department of Mathematical Sciences Carnegie Mellon University Pittsburgh ... A, T ⊆ B, |S|, |T |≥2ν. (4) Furthermore, if A, B is a random partition and H = H(A, B) is the bipartite sub-graph of G induced by A, B then with high probability d H (v) ∈ [(d−−o(1)...

Ngày tải lên: 07/08/2014, 06:22

... combinatorics 9 (2002), #N9 2 On a theorem of Erd˝os, Rubin, and Taylor on choosability of complete bipartite graphs Alexandr Kostochka ∗ University of Illinois at Urbana–Champaign, Urbana, IL 61801 and ... 05C65 Abstract Erd˝os, Rubin, and Taylor found a nice correspondence between the minimum order of a complete bipartite graph that is not r-choosable and the minimum number of edges in...

Ngày tải lên: 07/08/2014, 06:23

... k-connected, k-ordered, and balanced bipartite graph. The minimum degree is δ(G)=d(v)=|A 1 | for any vertex v ∈ B 2 ∪ A 2 ,thusthe minimum degree condition is just missed. But G is not k-ordered ... the following: Corollary 12. Let k ≥ 3 and let G be a k-ordered balanced bipartite graph of order 2n. If δ(G) ≥ n 2 + k−1 4 , then G is k-ordered hamiltonian. the electronic journal of...

Ngày tải lên: 07/08/2014, 07:21

... in which we recall some known results on bipartite graphs and related results on nonnegative matrices. In §3 we show that the maximum eigenvalue of a bipartite graph increases if we replace it by ... d m + e ′ s  d m + e ′ m −1 = d m + e − md m m − 1 = e − d m m − 1 . Recall that G D is not complete bipartite. Since d 1  ···  d m , we deduce that d m  e−1 m . Hence e −d m m − 1  f(m...

Ngày tải lên: 07/08/2014, 21:21

... degree δ and at least 2δ +1 vertices. Then G contains a path of at least 2δ +1vertices. The complete bipartite graphs K δ,n−δ with n ≥ 2δ + 1 show that the theorem is best possible in the sense that

Ngày tải lên: 07/08/2014, 06:20

Ngày tải lên: 07/08/2014, 07:21