Short proofs on k-extendible graphs
Abstract
In this note, we give short inductive proofs of two known results on k-extendible graphs based on a property proved in [Qinglin Yu, A note on n-extendable graphs. Journal of Graph Theory, 16:349-353, 1992].
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.