[Paper Review] A Set and Collection Lemma

Vadim E. Levit, Eugen Mǎndrescu|arXiv (Cornell University)|Jan 24, 2011

Advanced Graph Theory Research9 references3 citations

TL;DR

This paper introduces the 'Set and Collection Lemma,' a fundamental result in graph theory that establishes the existence of matchings between specific subsets of independent sets in a graph. It proves that for any independent set S and a non-empty collection Λ of maximum independent sets, there exists a matching from S minus the intersection of Λ into the union of Λ minus S, and derives a key inequality involving |S| + α(G) ≤ |∩Λ ∩ S| + |∪Λ ∪ S|, which generalizes and strengthens classical results like Berge's Maximum Stable Set Lemma and Hajnal's Clique Collection Lemma.

ABSTRACT

A set S is independent if no two vertices from S are adjacent. In this paper we prove that if F is a collection of maximum independent sets of a graph, then there is a matching from S-{intersection of all members of F} into {union of all members of F}-S, for every independent set S. Based on this finding we give alternative proofs for a number of well-known lemmata, as the "Maximum Stable Set Lemma" due to Claude Berge and the "Clique Collection Lemma" due to András Hajnal.

Motivation & Objective

• To establish a general framework for analyzing maximum independent sets in graphs using set-theoretic and matching-based relationships.
• To unify and strengthen classical results such as Berge's Maximum Stable Set Lemma and Hajnal's Clique Collection Lemma through a single, more general principle.
• To investigate structural properties of the core (intersection of all maximum independent sets) and corona (union of all maximum independent sets) in graphs.
• To characterize graphs satisfying the identity 2α(G) = |core(G)| + |corona(G)|, extending known results for König-Egerváry and very well-covered graphs.

Proposed method

• Formalizing the Set and Collection Lemma using set-theoretic operations on maximum independent sets and their intersections/unions.
• Applying Hall’s Marriage Theorem to prove the existence of a matching from S − ∩Λ into ∪Λ − S for any independent set S and non-empty collection Λ of maximum independent sets.
• Deriving the inequality |S| + α(G) ≤ |∩Λ ∩ S| + |∪Λ ∪ S| as a consequence of the matching existence, which generalizes known bounds.
• Translating results from independent sets to cliques via graph complementation, leading to the Clique Collection Lemma.
• Using the Matching Lemma (a component of the main result) to re-derive and strengthen Berge’s Maximum Stable Set Lemma.
• Analyzing König-Egerváry graphs and very well-covered graphs to identify conditions under which 2α(G) = |core(G)| + |corona(G)| holds.

Experimental results

Research questions

• RQ1 Under what conditions does a matching exist from S − ∩Λ into ∪Λ − S for any independent set S and non-empty collection Λ of maximum independent sets?
• RQ2 How does the inequality |S| + α(G) ≤ |∩Λ ∩ S| + |∪Λ ∪ S| generalize or strengthen existing lemmata in graph theory?
• RQ3 What is the structural relationship between the core and corona of a graph, and when does 2α(G) = |core(G)| + |corona(G)| hold?
• RQ4 Can the Set and Collection Lemma be used to re-derive or re-prove Berge’s Maximum Stable Set Lemma and Hajnal’s Clique Collection Lemma in a more general setting?
• RQ5 What are the necessary and sufficient conditions for a graph to satisfy 2α(G) = |core(G)| + |corona(G)|?

Key findings

• There exists a matching from S − ∩Λ into ∪Λ − S for any independent set S and non-empty collection Λ of maximum independent sets.
• The inequality |S| + α(G) ≤ |∩Λ ∩ S| + |∪Λ ∪ S| holds for any independent set S and any non-empty collection Λ of maximum independent sets.
• The Matching Lemma implies Berge’s Maximum Stable Set Lemma: an independent set X is maximum if and only if every independent set S disjoint from X can be matched into X.
• The Clique Collection Lemma is recovered as a corollary by applying the Set and Collection Lemma to the complement graph, yielding |∩Γ| ≥ 2ω(G) − |∪Γ| for any collection Γ of maximum cliques.
• For König-Egerváry graphs, the identity 2α(G) = |core(G)| + |corona(G)| holds, and this identity characterizes a broad class of graphs including very well-covered graphs.
• The converse of the identity 2α(G) = |core(G)| + |corona(G)| does not hold, as demonstrated by counterexamples like G₂ in Figure 3.