Excluding the fork and antifork
Maria Chudnovsky, Linda Cook, Paul Seymour
TL;DR
This paper characterizes all graphs that do not contain the fork or antifork as induced subgraphs, providing a complete structural description of these graph classes.
Contribution
It offers a complete characterization of graphs excluding the fork and antifork as induced subgraphs, expanding understanding of these specific graph classes.
Findings
Identifies all graphs free of the fork and antifork as induced subgraphs.
Provides structural descriptions for these graph classes.
Enhances understanding of graph classes defined by forbidden induced subgraphs.
Abstract
The fork is the tree obtained from the claw 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.