论文信息 - Adding random edges to create the square of a Hamilton cycle - 字舞流文

Adding random edges to create the square of a Hamilton cycle

We consider how many random edges need to be added to a graph of order $n$ with minimum degree $\alpha n$ in order that it contains the square of a Hamilton cycle w.h.p..

Andrzej Dudek | Patrick Bennett | Alan Frieze | A. Frieze | Patrick Bennett | A. Dudek

[1] P. Erdos,et al. On the existence of a factor of degree one of a connected random graph , 1966 .

[2] Colin McDiarmid,et al. Surveys in Combinatorics, 1989: On the method of bounded differences , 1989 .

[3] R. Nenadov,et al. Powers of cycles in random graphs and hypergraphs , 2017 .

[4] Alan M. Frieze,et al. Perfect matchings in random graphs with prescribed minimal degree , 2003, SODA '03.

[5] Endre Szemer,et al. Proof of the Seymour Conjecture for Large Graphs , 1998 .

[6] L. Pósa,et al. Hamiltonian circuits in random graphs , 1976, Discret. Math..

[7] O L I V E R R I O R D A N,et al. Spanning Subgraphs of Random Graphs , 1993 .

[8] Daniela Kühn,et al. On Pósa's Conjecture for Random Graphs , 2012, SIAM J. Discret. Math..

[9] Tom Bohman,et al. How many random edges make a dense graph hamiltonian? , 2003, Random Struct. Algorithms.

[10] J. Komlos,et al. First Occurrence of Hamilton Cycles in Random Graphs , 1985 .