The family of all local maximum independent sets is an augmentoid
Vadim E. Levit, Eugen Mandrescu

TL;DR
This paper proves that the family of all local maximum independent sets in any finite simple graph forms an augmentoid, providing explicit constructive methods and formulas for their structure, intersection, union, and enumeration.
Contribution
It establishes that the family of local maximum independent sets is an augmentoid for all graphs, with a constructive proof and explicit structural and counting formulas.
Findings
The family of local maximum independent sets forms an augmentoid in all graphs.
Provides explicit formulas for intersection, union, and enumeration of these sets.
Introduces a structural decomposition linking local maximum independent sets to graph substructures.
Abstract
It was proved in (Levit and Mandrescu, 2022) that both and are augmentoids, established partial augmentation phenomena for the family of local maximum independent sets, and asked in Problem~5.5 to characterize the graphs whose family is an augmentoid. We prove that the answer is positive in full generality: for every finite simple graph , the set system is an augmentoid. The proof is constructive. If , then the explicit choice \[ A=S \setminus N[T],\qquad B=T \setminus N[S] \] satisfies \[ T\cup A\in\Psi(G),\qquad S\cup B\in\Psi(G),\qquad |T\cup A|=|S\cup B|. \] As a structural consequence, for every fixed the map induces a canonical bijection from onto the members of containing , and \[ \alpha(G)=|S|+\alpha(G-N[S]). \] This…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Advanced Graph Theory Research · Graph theory and applications
