English

In absence of long chordless cycles, large tree-width becomes a local phenomenon

Combinatorics 2018-03-08 v1

Abstract

We prove that, for all \ell and ss, every graph of sufficiently large tree-width contains either a complete bipartite graph Ks,sK_{s,s} or a chordless cycle of length greater than \ell.

Keywords

Cite

@article{arxiv.1803.02703,
  title  = {In absence of long chordless cycles, large tree-width becomes a local phenomenon},
  author = {Daniel Weißauer},
  journal= {arXiv preprint arXiv:1803.02703},
  year   = {2018}
}