On the maximum number of edges in planar graphs of bounded degree and matching number
Abstract
We determine the maximum number of edges that a planar graph can have as a function of its maximum degree and matching number.
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.