Excluding the fork and antifork
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912003010854912 |
|---|---|
| author | Chudnovsky, Maria Cook, Linda Seymour, Paul |
| author_facet | Chudnovsky, Maria Cook, Linda Seymour, Paul |
| contents | The fork is the tree obtained from the claw $K_{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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_15005 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Excluding the fork and antifork Chudnovsky, Maria Cook, Linda Seymour, Paul Combinatorics The fork is the tree obtained from the claw $K_{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. |
| title | Excluding the fork and antifork |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2408.15005 |