Saturation (graph theory)

Key takeaways

Saturation (graph theory) belongs to science; place it in that map before memorising details.
Learn the definition first, then one example that makes the definition concrete.
Connect Saturation (graph theory) to a quantity you can measure, compute or draw — that is where exam questions come from.
Reproduce the core statement of Saturation (graph theory) from memory before moving on to harder problems.

Reference excerpt

In extremal graph theory, given a graph H {\displaystyle H} , a graph G {\displaystyle G} is said to be H {\displaystyle H} -saturated if G {\displaystyle G} does not contain a copy of H {\displaystyle H} as a subgraph, but adding any edge to G {\displaystyle G} creates a copy of H {\displaystyle H} . The saturation number, denoted sat ⁡ ( n , H ) {\displaystyle \operatorname {sat} (n,H)} , is the minimum number of edges in an H {\displaystyle H} -saturated graph on n {\displaystyle n} vertices. The graph saturation problem is the problem of determining sat ⁡ ( n , H ) {\displaystyle \operatorname {sat} (n,H)} for all graphs H {\displaystyle H} and positive integers n {\displaystyle n} . The saturation number was introduced in 1964 by Erdős, Hajnal, and Moon as a dual to the extremal number ex ⁡ ( n , H ) {\displaystyle \operatorname {ex} (n,H)} . The extremal number ex ⁡ ( n , H ) {\displaystyle \operatorname {ex} (n,H)} is the maximum number of edges in an H {\displaystyle H} -saturated graph on n {\displaystyle n} vertices; this is equivalent to its original definition as the maximum number of edges in an n {\displaystyle n} -vertex graph with no copy of H {\displaystyle H} .

Results Trivially, all complete bipartite graphs (with at least three edges) are C3-saturated, and more generally, all k-partite graphs (with at least k + 1 {\displaystyle k+1} edges) are Ck+1-saturated.

Complete graphs The following theorem exactly determines the saturation number for complete graphs.

Theorem (Erdős, Hajnal, and Moon, 1964). For integers n , r {\displaystyle n,r} satisfying 2 ≤ r ≤ n {\displaystyle 2\leq r\leq n} , sat ⁡ ( n , K r ) = ( r − 2 ) ( n − r + 2 ) + ( r − 2 2 ) {\textstyle \operatorname {sat} (n,K_{r})=(r-2)(n-r+2)+{\binom {r-2}{2}}} , and the unique K r {\displaystyle K_{r}} -saturated graph on n {\displaystyle n} vertices and sat ⁡ ( n , K r ) {\displaystyle \operatorname {sat} (n,K_{r})} edges is the graph join of K r − 2 {\displaystyle K_{r-2}} and the empty graph K ¯ n − r + 2 {\displaystyle {\overline {K}}_{n-r+2}} .

General bounds It follows from the definitions that sat ⁡ ( n , H ) ≤ ex ⁡ ( n , H ) {\displaystyle \operatorname {sat} (n,H)\leq \operatorname {ex} (n,H)} . In contrast to the extremal number, however, for a fixed graph H {\displaystyle H} , the saturation number sat ⁡ ( n , H ) {\displaystyle \operatorname {sat} (n,H)} is always at most linear in n {\displaystyle n} .

Theorem (Kászonyi and Tuza, 1986). For any fixed graph H {\displaystyle H} , if H {\displaystyle H} has an isolated edge, then sat ⁡ ( n , H ) = c H + o ( 1 ) {\displaystyle \operatorname {sat} (n,H)=c_{H}+o(1)} for some constant c H {\displaystyle c_{H}} , and otherwise, sat ⁡ ( n , H ) = Θ ( n ) {\displaystyle \operatorname {sat} (n,H)=\Theta (n)} . In particular, sat ⁡ ( n , H ) = O ( n ) {\displaystyle \operatorname {sat} (n,H)=O(n)} . It is conjectured that a stronger form of asymptotic stability holds.

… excerpt ends here. Continue reading the full article.

Illustrations

Worked examples

Example 1 — a first encounter with Saturation (graph theory)

Start with the simplest possible case. Write down what Saturation (graph theory) claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In science, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Saturation (graph theory) before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Saturation (graph theory) ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Saturation (graph theory)

In research: Saturation (graph theory) appears in science research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry: Engineering practice reuses Saturation (graph theory) in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom: Saturation (graph theory) is common in secondary-school and first-year university syllabi. It links to neighbouring topics Extremal graph theory, Graph theory stubs, so understanding it makes those chapters shorter.
In everyday life: Look for Saturation (graph theory) outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.

How to study Saturation (graph theory) in 20 minutes

Read the reference excerpt below once, without taking notes.
Close the page and write down what Saturation (graph theory) means in your own words.
Compare your version with the excerpt and mark what you missed.
Work through the three examples above with pen and paper.
Explain Saturation (graph theory) out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Saturation (graph theory) in simple terms?

In extremal graph theory, given a graph H {\displaystyle H} , a graph G {\displaystyle G} is said to be H {\displaystyle H} -saturated if G {\displaystyle G} does not contain a copy of H {\displaystyle H} as a subgraph, but adding any edge to G {\displaystyle G} creates a copy of H {\displaystyle H…

Why does Saturation (graph theory) matter?

Because it connects several science ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Saturation (graph theory)?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Saturation (graph theory).