Long cycles in locally expanding graphs, with applications

2016/09/22 by Krivelevich, Michael · 2 citations
#05C38 #05C57 #05C80 #05D10 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1609.06851

Abstract

We provide sufficient conditions for the existence of long cycles in locally expanding graphs, and present applications of our conditions and techniques to Ramsey theory, random graphs and positional games.

Cited by

• The multicolour size Ramsey number of a path
• Size-Ramsey numbers of tight paths

Related

• Finding long cycles in a percolated expander graphs
• Hamilton cycles in highly connected and expanding graphs
• Long paths and Hamiltonicity in random graphs
• Local Improvement Gives Better Expanders
• Cycle lengths in expanding graphs