Stabbing non-piercing sets and face lengths in large girth plane graphs
Abstract
We show that a non-piercing family of connected planar sets with bounded independence number can be stabbed with a constant number of points. As a consequence, we answer a question of Axenovich, Kiele and Sagdeev about the largest possible face length of an edge-maximal plane graph with girth at least .
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.