Premium
The threshold for hamilton cycles in the square of a random graph
Author(s) -
Cooper C.
Publication year - 1994
Publication title -
random structures and algorithms
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.314
H-Index - 69
eISSN - 1098-2418
pISSN - 1042-9832
DOI - 10.1002/rsa.3240050105
Subject(s) - hamiltonian path , square (algebra) , mathematics , combinatorics , graph , hamiltonian (control theory) , random graph , statistical physics , discrete mathematics , physics , mathematical optimization , geometry
We show in G n.p ' that the threshold for δ( G ) ⩾ 1 is the threshold for G 2 – G to be Hamiltonian. © 1994 John Wiley & Sons, Inc.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom