English

Proper Minor-Closed Classes in Blowups of Fans

Combinatorics 2024-09-23 v1

Abstract

Dujmovi\'{c} et al. [arXiv:2407.05936] showed that any nn-vertex planar graph is contained in a O(nlog2(n))O(\sqrt{n}\log^2(n))-blowup of a fan, and asked if the same holds for any nn-vertex KtK_t-minor-free graph. We answer this in the positive, showing that such a graph is contained in a Ot(nlog2(n))O_t(\sqrt{n}\log^2(n))-blowup of a fan.

Keywords

Cite

@article{arxiv.2409.13248,
  title  = {Proper Minor-Closed Classes in Blowups of Fans},
  author = {Marc Distel},
  journal= {arXiv preprint arXiv:2409.13248},
  year   = {2024}
}

Comments

12 pages, 2 figures