The $K_{n+5}$ and $K_{3^2,1^n}$ families are obstructions to $n$-apex
Thomas W. Mattman, Mike Pierce

TL;DR
This paper investigates specific graph families, $K_{n+5}$ and $K_{3^2,1^n}$, providing evidence that they serve as obstructions to the property of being $n$-apex, which relates to graph simplification.
Contribution
It offers evidence supporting the conjecture that these graph families are obstructions to the $n$-apex property, advancing understanding of graph minor theory.
Findings
Evidence supporting the conjecture for these graph families.
Identification of these families as obstructions to $n$-apex.
Contributes to the theory of graph minors and obstructions.
Abstract
We give evidence in support of a conjecture that the Y families of and are obstructions for the -apex property.
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.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Algebraic structures and combinatorial models · Advanced Algebra and Geometry
