English

Excluding the fork and antifork

Combinatorics 2024-08-28 v1

Abstract

The fork is the tree obtained from the claw K1,3K_{1,3} by subdividing one of its edges once, and the antifork is its complement graph. We give a complete description of all graphs that do not contain the fork or antifork as induced subgraphs.

Cite

@article{arxiv.2408.15005,
  title  = {Excluding the fork and antifork},
  author = {Maria Chudnovsky and Linda Cook and Paul Seymour},
  journal= {arXiv preprint arXiv:2408.15005},
  year   = {2024}
}

Comments

This is an old paper. It was published in 2020 in Discrete Math where it was awarded Editors' choice

R2 v1 2026-06-28T18:25:21.850Z