Báo cáo toán học: "MULTICOLOURED HAMILTON CYCLES" docx
Báo cáo toán học: "MULTICOLOURED HAMILTON CYCLES" docx
... incident with a common vertex. 3.2 Proof of Theorem 4 Let H be a Hamilton cycle chosen uniformly at random from the set of (n − 1)!/2 Hamilton cycles of K n .Let{(e i ,f i ): 1≤ i ≤ N} be an enumeration of ... Mathematics 62 (1986) 29-33. [8] L.P´osa ,Hamilton circuits in random graphs,Discrete Mathematics 14 (1976) 359-64. [9] P.Winkler, Private Communication. MULTICOLOURED HAMILTON C...
Ngày tải lên: 07/08/2014, 06:20
Báo cáo toán học: "Multicoloured Hamilton cycles in random graphs; an anti-Ramsey threshold" pot
... Szemer´edi. The first occurrence of Hamilton cycles in random graphs. Annals of Discrete Mathematics 27 (1985) 173-178. [2] M.J. Albert, A.M. Frieze and B. Reed, Multicoloured Hamilton Cycles. Electronic ... On matchings and Hamiltonian cycles in random graphs. Annals of Discrete Mathematics 28 (1985) 23-46. [6] B. Bollob´as, T.I. Fenner and A.M. Frieze. An algorithm for finding Hamilton...
Ngày tải lên: 07/08/2014, 06:20
Báo cáo toán học: "Bent Hamilton Cycles in d-Dimensional Grid Graphs" pdf
... a bent Hamilton cycle in Q(3, 3, 6). From this illustrative exam- ple the reader should be convinced that it is possible to construct a bent Hamilton cycle in Q(n, m, 2k) from a bent Hamilton ... 4 Q 3 v 4 v 3 v 2 Q 4 Q 1 Q 2 w 1 x 1 v 1 u 1 Figure 6: Using a bent Hamilton cycle in Q(2, 2, 2) to obtain bent Hamilton cycle in Q(2, 2, 2, 4). In Figure 6 we illustrate the proof by show...
Ngày tải lên: 07/08/2014, 07:21
Báo cáo toán học: "Loose Hamilton Cycles in Random 3-Uniform Hypergraphs" doc
... if p K log n n 2 then lim n→∞ 4|n Pr(H n,p;3 contains a loose Hamilton cycle) = 1. 1 Introduction The threshold for the existence of Hamilton cycles in the random graph G n,p has been known for ... x ′ ) of colour y if (x, y, x ′ ) is an edge of H. If G ∗ contains a rainbow Hamilton cycle, then H contains a loose Hamilton cycle. We will use Theorem 2 to show that whp G ∗ contains an...
Ngày tải lên: 08/08/2014, 11:20
Báo cáo toán học: "Loose Hamilton Cycles in Random Uniform Hypergraphs" pps
... which counts the number of loose Hamilton cycles in Λ d such that the edges only intersect in X. Note that every such loose Hamilton cycle induces an ordinary Hamilton cycle of length 2m in X ... then lim n→∞ 2(k−1)|n Pr(H n,p;k contains a loose Hamilton cycle) = 1. Thus (log n)/n k−1 is the asymptotic threshold for the existence of loose Hamilton cycles, at least for n a multiple o...
Ngày tải lên: 08/08/2014, 12:23
Báo cáo toán học: "Geodetic topological cycles in locally finite graphs" docx
Ngày tải lên: 08/08/2014, 01:20
