Any (n,d,lambda)-graph with lambda/d small contains an induced cycle of length Omega(n/d), and this is tight up to constants.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
A large hole in pseudo-random graphs
Any (n,d,lambda)-graph with lambda/d small contains an induced cycle of length Omega(n/d), and this is tight up to constants.