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.
A tau-critical graph with a large low-degree induced subgraph has a rooted stable-tooth comb
Statement
For all reals with , there exists such that the following holds for every real with .
Let be a -critical graph, and let satisfy . Suppose the induced subgraph has maximum degree at most . Then there are:
- an integer ;
- vertices ; and
- pairwise disjoint sets
such that
is a rooted stable-tooth comb in , and each block satisfies
Facts & Assumptions
Given: Reals with , a real , a -critical graph , and a set with such that has maximum degree at most .
If is -critical, then , and every proper induced subgraph of satisfies (A tau-critical graph, Subgraphs, induced subgraphs and spanning subgraphs).
For every finite graph , (The parameter kappa(G)=alpha(G)omega(G), Cliques, stable sets, the clique number and stability number ).
The bipartite theorem gives either a -comb when , or the explicit bound (A bipartite graph with bounded A-degree has a large comb or a small B-side).
A rooted stable-tooth comb consists of a comb whose teeth form a stable set, together with a root adjacent to all teeth and anticomplete to all blocks (A rooted stable-tooth comb).
Proof
If , then no nonempty graph can have a subset with , so the theorem is vacuous. Hence we may assume . Choose so small that . Because , decreasing decreases both summands, so the same inequality holds for every .
By [L1], . Since is a positive integer for every nonempty graph, it cannot equal : otherwise [L2] would force , hence , contradicting . Therefore , so and hence .
Set . As long as , choose a vertex of maximum degree in , let , choose a stable set with , and let be the set of vertices in with no neighbour in . This is possible because when , the induced subgraph is proper, so [L1] and [L2] give . The process stops after finitely many steps because , so whenever .
For , the set is contained in , so by construction there are no edges from to . Hence are pairwise nonadjacent, and is stable. For each , let be the set of vertices in that have a neighbour in . Then , because every vertex removed when passing from to is either , a neighbour of , or a vertex outside with a neighbour in .
Put . Fix . If , then and therefore , so certainly . Assume now that . Every vertex of has a neighbour in by definition, and every vertex of has at most neighbours in because has maximum degree in and . Apply [L3] to the bipartite graph between and with , , and . If [L3] yields a -comb in , then the blocks lie in , the teeth lie in the stable set , and is adjacent to every tooth and anticomplete to every block. Thus [L4] gives a rooted stable-tooth comb in . Also because the disjoint blocks lie in , so , and . Therefore the theorem is proved in this case. We may hence assume instead that . This bound now holds for every .
Let . Since is stable by step 2.1, its size is at most . On the other hand, step 1.3 and [L1] give . Summing over and dividing by yields .
Since are stable by step 2.1, we have , where the last inequality uses step 1.2.
Because and has maximum degree in , we have . Hence , and, because , .
Divide the partition identity in step 2.1 by . Using step 3.1 and the bound on from step 4.1, we obtain . Combining this with steps 1.1 and 3.3 gives , a contradiction. Therefore the comb outcome in step 3.1 must occur, and that outcome yields exactly the rooted stable-tooth comb asserted in the Statement.
Depends on
Used by
Dependency tree · two levels
17 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
- Maria Chudnovsky, Alex Scott, Paul Seymour, and Sophie Spirkl, Erdős-Hajnal for graphs with no 5-hole, Theorem 3.1 (standard reference, not scraped)