Graphs are a natural thread through combinatorics because they let you ask crisp questions and still encounter the full range of combinatorial techniques. A graph problem can be:
- structural: what must a graph look like under constraints
- extremal: how large can some feature be
- algorithmic: how to find a witness efficiently
- probabilistic: what is typical under a random model
- algebraic: how eigenvalues and rank encode combinatorial information
This article is a sequence of worked examples that are chosen to showcase methods, not just results. Each example is self-contained and ends with the same kind of takeaway:
Premium Controller PickCompetitive PC ControllerRazer Wolverine V3 Pro 8K PC Wireless Gaming Controller
Razer Wolverine V3 Pro 8K PC Wireless Gaming Controller
A strong accessory angle for controller roundups, competitive input guides, and gaming setup pages that target PC players.
- 8000 Hz polling support
- Wireless plus wired play
- TMR thumbsticks
- 6 remappable buttons
- Carrying case included
Why it stands out
- Strong performance-driven accessory angle
- Customizable controls
- Fits premium controller roundups well
Things to know
- Premium price
- Controller preference is highly personal
- what invariant mattered
- what proof move unlocked it
- what the clean certificate looks like when you want to verify the claim
Worked example: Turán’s theorem as extremal counting
Fix $n$ and forbid a complete graph $K_{r+1}$. The extremal question is:
- What is the maximum number of edges an $n$-vertex graph can have without containing $K_{r+1}$?
The answer is given by the Turán graph $T_r(n)$, the complete $r$-partite graph with parts as equal as possible.
The combinatorial invariant
The invariant is the number of edges across a partition. In an $r$-partite graph, edges are allowed only between parts. For fixed part sizes $n_1,\dots,n_r$ with $\sum n_i=n$, the edge count is:
- $e = \sum_{i<j} n_i n_j$
A standard algebraic rewrite is:
- $\sum_{i<j} n_i n_j = \frac{1}{2}\left((\sum_i n_i)^2 – \sum_i n_i^2\right)$
So maximizing edges is equivalent to minimizing $\sum_i n_i^2$, which happens when the parts are as equal as possible.
The key proof move
Turán’s theorem is often proved by a symmetrization or averaging move that improves a graph without creating the forbidden clique while increasing edges.
A clean high-level version is:
- Among all $K_{r+1}$-free graphs with maximum edges, choose one with a degree sequence that is maximal under local improvements.
- Show that if it is not complete $r$-partite, you can modify it to increase the edge count without introducing $K_{r+1}$, contradicting maximality.
Even if you do not memorize the symmetrization details, remember the strategy:
- extremal graphs often gain additional symmetry under local improvement steps
Certificate viewpoint
If someone claims a graph is extremal, the certificate is:
- a partition into $r$ independent sets
- plus the assertion that all cross edges are present
This certificate is checkable by inspection and it explains why Turán’s theorem is a cornerstone: it couples a sharp numerical bound with a rigid structural description of equality.
Worked example: Hall’s theorem as a local-\to-global gluing principle
Matching is where combinatorics teaches you to respect the difference between vertex degrees and neighborhood expansion.
Let $G=(L \cup R, E)$ be bipartite. We want a matching that covers $L$, also called an $L$-perfect matching.
Hall’s theorem says:
- Such a matching exists if and only if for every \subset $S\subseteq L$, the neighborhood $N(S)\subseteq R$ satisfies $|N(S)| \ge |S|$.
The combinatorial invariant
The invariant is neighborhood size. Degrees are local, neighborhoods are the correct medium-scale object.
The key idea is that the only obstruction to covering $L$ is a shortage of available neighbors for some \subset $S$. That obstruction is explicit and checkable.
The key proof move
A standard proof uses alternating paths and minimal counterexample structure.
A clean strategic version is:
- Assume Hall’s condition holds.
- Build a maximal matching.
- If it fails to cover some $x\in L$, explore alternating paths from $x$ and define $S$ as the set of left vertices reachable by alternating paths.
- Show that $|N(S)| < |S|$, contradicting Hall.
The proof is a model of how combinatorics glues local steps into a global conclusion while tracking the right invariant.
Certificate viewpoint
Hall’s theorem gives certificates for both outcomes.
- If a matching exists, the matching itself is the certificate.
- If none exists, a violating \subset $S$ with $|N(S)|<|S|$ is a certificate of impossibility.
That dual certificate structure is one reason matching theory is so central: it fits naturally into verification and computation.
Worked example: Counting spanning trees with the matrix-tree theorem
Spanning trees are the bridge between combinatorics and linear algebra.
Given a graph $G$ on $n$ vertices, define its Laplacian matrix $L$ by:
- $L_{ii} = \deg(v_i)$
- $L_{ij} = -1$ if $i\neq j$ and $v_i$ is adjacent \to $v_j$
- $L_{ij} = 0$ otherwise
The matrix-tree theorem says:
- Any cofactor of $L$ equals the number of spanning trees of $G$.
The combinatorial invariant
The invariant is the determinant of a minor, which is not obviously combinatorial until you learn why it is.
The Laplacian encodes incidence information. Determinants expand into sums over bijective reorderings, and cancellations leave exactly the contributions corresponding to trees.
The key proof move
A common proof uses the incidence matrix and Cauchy–Binet:
- Write $L = BB^\top$ where $B$ is an oriented incidence matrix.
- Apply Cauchy–Binet \to a minor of $L$ \to express it as a sum of squares of determinants of minors of $B$.
- Show that nonzero minors correspond exactly to spanning trees, and each contributes $1$.
Strategically, the move is:
- factor a combinatorial matrix into an incidence factor
- use determinant identities to transform a global count into a sum over structured subobjects
Certificate viewpoint
The theorem gives a way to compute a count, but it also gives a checkable path:
- If you propose a number for the tree count, you can verify it by computing a determinant, which is mechanical.
This is a recurring theme: linear algebra turns combinatorial questions into verifiable algebraic computations.
Worked example: A clean probabilistic method claim in graphs
The probabilistic method often proves existence without constructing a specific example. The goal is still to keep a certificate in mind: existence is proved by showing that a randomly chosen object has positive probability of having the property.
A classic pattern is:
- define a random graph model
- define a bad event
- show the bad event probability is less than one
- conclude an object with no bad event exists
Here is a concrete statement that stays inside graph combinatorics:
- There exist graphs with both large girth and large chromatic number.
Girth is the length of the shortest cycle, and chromatic number is the minimum number of colors needed for a proper vertex coloring.
The combinatorial invariant
The invariants are:
- counts of short cycles
- size of large independent sets, because $\chi(G) \ge n/\alpha(G)$ where $\alpha(G)$ is the independence number
The key proof move
One route is:
- choose a random graph $G(n,p)$ with carefully chosen $p$
- show the expected number of short cycles is small
- show the expected number of large independent sets is also small
- delete one vertex from each short cycle to eliminate all short cycles
- argue that the remaining graph still has small independence number, hence large chromatic number
The important strategy lesson is that deletion is not a hack. It is part of the method:
- first show a random object is close to having the desired property
- then correct it by removing a controlled amount of structure
Certificate viewpoint
Even though the method is nonconstructive in spirit, it can be made constructive by derandomization, but even without that, the proof still leaves a witness form:
- a graph with no short cycles and with small independent sets
You can verify the property by checking for short cycles and testing independence bounds, though the latter may be computationally hard in general. The proof strategy still teaches you what to check.
Worked example: An eigenvalue bound as a bridge to linear algebra
Spectral graph theory is often introduced as a separate subject, but the core combinatorial move is simple: turn adjacency into a matrix, then let orthogonality and eigenvalues enforce inequalities that are hard to see by counting alone.
Let $G$ be a $d$-regular graph on $n$ vertices with adjacency matrix $A$. The eigenvalues satisfy:
- $\lambda_1 = d$
- all other eigenvalues lie in $[-d,d]$
A clean combinatorial application is a bound on the size of an independent set. If $S\subseteq V$ is independent, then no edges lie inside $S$. Write $1_S$ for the indicator vector of $S$. The quadratic form $1_S^\top A 1_S$ counts twice the number of edges inside $S$, so for an independent set it equals $0$.
Decompose $1_S$ into the eigenbasis of $A$. The component along the all-ones eigenvector interacts with $\lambda_1=d$, while the orthogonal part interacts with the smallest eigenvalue $\lambda_{\min}$. This yields the Hoffman bound:
- $\alpha(G) \le \frac{n(-\lambda_{\min})}{d-\lambda_{\min}}$
where $\alpha(G)$ is the independence number.
The strategic lesson is not the formula. It is the certificate shape:
- independence forces a quadratic form to vanish
- eigenvalues turn that vanishing into a quantitative bound
Once you have an upper bound on $\alpha(G)$, you immediately get a lower bound on chromatic number:
- $\chi(G) \ge n/\alpha(G)$
So eigenvalues become a tool for coloring and structure, not just for computation.
This method fits the same pattern as the matrix-tree theorem:
- encode the combinatorial constraint as a matrix identity
- apply a general linear-algebra inequality
- translate the result back into a sharp graph bound
The unifying habits from the examples
The examples above are diverse, but they share a small set of methods. If you want to become fluent in combinatorics, train these habits until they become automatic.
- For extremal problems, look for a symmetrization or averaging step that pushes an object toward a canonical extremal shape.
- For existence problems with local constraints, look for a gluing invariant such as neighborhood expansion, and aim for a dual certificate of failure.
- For counting problems, translate the structure into a matrix and look for a determinant, rank, or eigenvalue identity that isolates the objects you want.
- For probabilistic existence, define a random model, bound the bad events, and plan a correction step that removes the remaining defects.
Graphs are not just a topic. They are a training ground for these methods because they compress the essence of combinatorial reasoning into objects you can draw and invariants you can compute.
If you can work through these examples and explain, in your own words, what each proof is really tracking, you will have learned something deeper than any single theorem:
- combinatorics is the art of choosing the right invariant and then forcing it to speak globally.
Books by Drew Higgins
Christian Living / Encouragement
God’s Promises in the Bible for Difficult Times
A Scripture-based reminder of God’s promises for believers walking through hardship and uncertainty.
Leave a Reply