How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Gallai's modular decomposition theorem: a graph on at least two vertices is disconnected, or has a disconnected complement, or has a modular partition into its maximal proper modules whose quotient is prime
Statement
Let be a finite simple graph with . Then exactly one of the following holds.
- is disconnected. The vertex sets of its connected components form a modular partition of , and the quotient by that partition has no edge.
- is disconnected. The anticomponents of form a modular partition of , and the quotient by that partition has every pair of distinct vertices as an edge.
- and are both connected. The maximal proper modules , , form a modular partition of with at least two parts, and the quotient by that partition is prime.
Facts & Assumptions
Given: A finite simple graph with .
In a connected and anticonnected graph with at least two vertices, each vertex lies in a largest proper module , any two of these are equal or disjoint, and they cover (In a connected and anticonnected graph with at least two vertices, each vertex lies in a largest proper module, and two such modules are equal or disjoint).
Every union of vertex sets of connected components is a module, with every outside vertex anticomplete to it, and every union of anticomponents is a module, with every outside vertex complete to it (Every union of connected components is a module, and so is every union of anticonnected components).
Every finite graph with at least two vertices is connected or anticonnected (Every graph with at least two vertices is connected or anticonnected, Anticonnected graphs and anticonnected components).
A modular partition of is a set of nonempty, pairwise disjoint modules of whose union is ; the quotient has vertex set , with distinct parts adjacent exactly when is a complete pair in (Modular partitions and the quotient graph they define).
For a modular partition and , the set is a module of if and only if is a module of (For a modular partition, a set of parts is a module of the quotient exactly when the union of those parts is a module of the graph).
is prime when every module of is trivial, the trivial modules being , the singletons and the whole vertex set (Prime graphs: those whose only modules are the trivial ones, Modules of a graph, and the trivial modules).
The vertex sets of the connected components are nonempty, cover , and any two are equal or disjoint; a graph is disconnected when it has a vertex and two of its vertices are joined by no path, and then it has at least two components (The connected components of a graph partition its vertex set and are its maximal connected subgraphs, Connected graphs and connected components defined by the existence of vertex paths).
The anticomponents of are exactly the vertex sets of the connected components of , and they partition (The anticonnected components of are exactly the connected components of ).
Distinct connected components are anticomplete to one another, and distinct anticomponents are complete to one another (Distinct connected components are anticomplete, and distinct anticonnected components are complete).
Proof
By [L3] the graph is connected or anticonnected, so it is not the case that both and are disconnected; the three listed situations are therefore mutually exclusive, and they are exhaustive because is disconnected, or is disconnected, or both are connected.
First case: is disconnected. By [L5] the vertex sets of its components are nonempty, pairwise disjoint and cover , and by [L2] each is a module, so they form a modular partition .
Second case: is disconnected, that is, is not anticonnected. By [L6] the anticomponents are nonempty, pairwise disjoint and cover , and by [L2] each is a module, so they form a modular partition .
Third case: and are both connected, so is connected and anticonnected. By [L1] the sets are proper modules, pairwise equal or disjoint, and cover ; they are nonempty since , so the distinct ones form a modular partition .
In the first case, distinct components are anticomplete to one another by [L7], so no pair of distinct parts of is complete and the quotient has no edge.
In the second case, distinct anticomponents are complete to one another by [L7], so every pair of distinct parts of is complete and every pair of distinct vertices of is an edge.
In the third case has at least two parts: a single part would be for some , contradicting that is proper.
Still in the third case, let be a module of that is neither nor , and put . By [L4] the set is a module of , and because some part outside is nonempty and disjoint from , so is a proper module.
Choose , possible because , and , possible because parts are nonempty. Then for some , and meets at , so by [L1]; the set is a proper module containing , so maximality gives . Every therefore satisfies , and a part distinct from is disjoint from and nonempty, so no such part lies in : that is, .
So in the third case every module of is , a singleton or all of , that is, is prime; with steps 1.1, 2.1, 2.2 and 2.3 this proves all three clauses and their mutual exclusion.
Depends on
- In a connected and anticonnected graph with at least two vertices, each vertex lies in a largest proper module, and two such modules are equal or disjoint
- Every union of connected components is a module, and so is every union of anticonnected components
- Every graph with at least two vertices is connected or anticonnected
- Modular partitions and the quotient graph they define
- For a modular partition, a set of parts is a module of the quotient exactly when the union of those parts is a module of the graph
- Prime graphs: those whose only modules are the trivial ones
- Modules of a graph, and the trivial modules
- Anticonnected graphs and anticonnected components
- The connected components of a graph partition its vertex set and are its maximal connected subgraphs
- The anticonnected components of $G$ are exactly the connected components of $\overline G$
- Distinct connected components are anticomplete, and distinct anticonnected components are complete
- Connected graphs and connected components defined by the existence of vertex paths
Used by
Dependency tree · two levels
28 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- M. Habib and C. Paul, A Survey on Algorithmic Aspects of Modular Decomposition, sec. 2.3 (standard reference, not scraped)
- T. Harju, Lecture Notes on Combinatorial Structures in Graph Theory, sec. 4 (standard reference, not scraped)