Whp, the uniform attachment graph Gn,k has a perfect matching for k>=5 and a Hamilton cycle for k>=13, improving prior bounds via new small-set expansion rates.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Perfect matchings and Hamilton cycles in uniform attachment graphs
Whp, the uniform attachment graph Gn,k has a perfect matching for k>=5 and a Hamilton cycle for k>=13, improving prior bounds via new small-set expansion rates.