Cubic graphs with equal independence number and matching number
Abstract
Caro, Davila, and Pepper (arXiv:1909.09093) recently proved δ(G) α(G)≤ (G) μ(G) for every graph G with minimum degree δ(G), maximum degree (G), independence number α(G), and matching number μ(G). Answering some problems they posed, we characterize the extremal graphs for δ(G)<(G) as well as for δ(G)=(G)=3.
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.