Piercing independent sets in graphs without large induced matching
Abstract
Given a graph G, denote by h(G) the smallest size of a subset of V(G) which intersects every maximum independent set of G. We prove that any graph G without induced matching of size t satisfies h(G) ω(G)3t-3+o(1). This resolves a conjecture of Hajebi, Li and Spirkl (Hitting all maximum stable sets in P5-free graphs, JCTB 2024).
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.