Every K_{s,s}-free graph with an n-vertex path contains an induced path of length Ω(log log n / log log log n), nearly matching the known upper bound.
Bollobás,Extremal Graph Theory, Dover Publications, 2004
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2024 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Long induced paths in $K_{s, s}$-free graphs
Every K_{s,s}-free graph with an n-vertex path contains an induced path of length Ω(log log n / log log log n), nearly matching the known upper bound.