Sharp thresholds for nonlinear Hamiltonian cycles in hypergraphs
暂无分享,去创建一个
[1] Andrzej Dudek,et al. Tight Hamilton cycles in random uniform hypergraphs , 2011, Random Struct. Algorithms.
[2] E. Upfal,et al. On factors in random graphs , 1981 .
[3] J. Komlos,et al. First Occurrence of Hamilton Cycles in Random Graphs , 1985 .
[4] E. Friedgut,et al. Sharp thresholds of graph properties, and the -sat problem , 1999 .
[5] János Komlós,et al. Limit distribution for the existence of Hamiltonian cycles in a random graph , 2006, Discret. Math..
[6] E. Friedgut. Hunting for sharp thresholds , 2005 .
[7] L. Pósa,et al. Hamiltonian circuits in random graphs , 1976, Discret. Math..
[8] János Komlós,et al. Limit distribution for the existence of hamiltonian cycles in a random graph , 1983, Discret. Math..
[9] Richard Montgomery,et al. Spanning trees in random graphs , 2018, Advances in Mathematics.
[10] Béla Bollobás,et al. Threshold functions , 1987, Comb..
[11] Oliver Riordan,et al. Spanning Subgraphs of Random Graphs , 2000, Combinatorics, Probability and Computing.
[12] Akalu Tefera,et al. Combinatorial and Automated Proofs of Certain Identities , 2011, Electron. J. Comb..
[13] Alan M. Frieze,et al. Loose Hamilton Cycles in Random 3-Uniform Hypergraphs , 2010, Electron. J. Comb..