In absence of long chordless cycles, large tree-width becomes a local phenomenon
classification
🧮 math.CO
keywords
chordlessgraphlargetree-widthabsencebecomesbipartitecomplete
read the original abstract
We prove that, for all $\ell$ and $s$, every graph of sufficiently large tree-width contains either a complete bipartite graph $K_{s,s}$ or a chordless cycle of length greater than $\ell$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.