Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-08-31
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 δ,ϵ>0 with ϵ<1/20, there exists τ0>0 such that the following holds for every real τ with 0<ττ0.

Let G be a τ-critical graph, and let XV(G) satisfy XδV(G). Suppose the induced subgraph G[X] has maximum degree at most ϵδV(G). Then there are:

  1. an integer t1/(400ϵ);
  2. vertices a1,,at,vX; and
  3. pairwise disjoint sets B1,,BtX

such that

(v, ((ai,Bi):1it))

is a rooted stable-tooth comb in G[X], and each block satisfies

BiδV(G)400ϵt2.

Facts & Assumptions

Given: Reals δ,ϵ>0 with ϵ<1/20, a real τ(0,τ0], a τ-critical graph G, and a set XV(G) with XδV(G) such that G[X] has maximum degree at most ϵδV(G).

[L1]

If G is τ-critical, then κ(G)<V(G)τ, and every proper induced subgraph H of G satisfies κ(H)V(H)τ (A tau-critical graph, Subgraphs, induced subgraphs and spanning subgraphs).

[L3]

The bipartite theorem gives either a (t,Γt2)-comb when d=1/2, or the explicit bound B33/23/2(3/2)1/2Γ1/2Δ1/2 (A bipartite graph with bounded A-degree has a large comb or a small B-side).

[L4]

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

technique · direct
1.1

If δ>1, then no nonempty graph can have a subset XV(G) with XδV(G), so the theorem is vacuous. Hence we may assume δ1. Choose τ0(0,1/2) so small that 211/τ0δ+(ϵ+1920)(ϵδ)τ0<1. Because ϵδ<1/20<1, decreasing τ decreases both summands, so the same inequality holds for every 0<ττ0.

givenchoose
1.2

By [L1], κ(G)<V(G)τ. Since κ(G) is a positive integer for every nonempty graph, it cannot equal 1: otherwise [L2] would force α(G)=ω(G)=1, hence V(G)=1, contradicting 1<1τ. Therefore κ(G)2, so 2<V(G)τ and hence V(G)>21/τ.

L1L2algebra
1.3

Set X0:=X. As long as Xi1, choose a vertex viXi1 of maximum degree in G[Xi1], let Ai:=NG[Xi1](vi), choose a stable set CiAi with CiAiτ/ω(G), and let Xi be the set of vertices in Xi1{vi} with no neighbour in {vi}Ci. This is possible because when Ai, the induced subgraph G[Ai] is proper, so [L1] and [L2] give α(G[Ai])κ(G[Ai])/ω(G)Aiτ/ω(G). The process stops after finitely many steps because viXi, so Xi<Xi1 whenever Xi1.

L1L2choose
2.1

For i<j, the set Xj is contained in Xi, so by construction there are no edges from {vi}Ci to Xj. Hence v1,,vs are pairwise nonadjacent, and C1Cs is stable. For each i, let Di be the set of vertices in Xi1(Ai{vi}) that have a neighbour in Ci. Then X={v1,,vs}A1AsD1Ds, because every vertex removed when passing from Xi1 to Xi is either vi, a neighbour of vi, or a vertex outside Ai{vi} with a neighbour in Ci.

step 1.3algebra
3.1

Put γ:=δ/(400ϵ). Fix 1is. If Ai=, then Ci= and therefore Di=, so certainly Di19AiX/(400ϵ). Assume now that Ai. Every vertex of Di has a neighbour in Ci by definition, and every vertex of Ci has at most Ai neighbours in Di because vi has maximum degree in G[Xi1] and Ai=degG[Xi1](vi). Apply [L3] to the bipartite graph between Ci and Di with Γ:=γX/δ=X/(400ϵ), Δ:=Ai, and d:=1/2. If [L3] yields a (t,Γt2)-comb ((aj,Bj):1jt) in (Ci,Di), then the blocks lie in X, the teeth lie in the stable set Ci, and vi is adjacent to every tooth and anticomplete to every block. Thus [L4] gives a rooted stable-tooth comb in G[X]. Also tΓt2X because the t disjoint blocks lie in X, so t1/(400ϵ), and Γt2=X/(400ϵt2)δV(G)/(400ϵt2). Therefore the theorem is proved in this case. We may hence assume instead that Di33/23/2(3/2)1/2AiX/(400ϵ)19AiX/(400ϵ). This bound now holds for every 1is.

step 2.1L3L4algebracases
3.2

Let xi:=Ai/X. Since C1Cs is stable by step 2.1, its size is at most α(G). On the other hand, step 1.3 and [L1] give CiAiτ/ω(G)=xiτXτ/ω(G)(xiδ)τV(G)τ/ω(G)>(xiδ)τα(G). Summing over i and dividing by α(G) yields i=1sxiτ<δτ.

step 1.3step 2.1L1L2algebra
3.3

Since v1,,vs are stable by step 2.1, we have sXα(G)Xκ(G)X<V(G)τXV(G)τ1δ<211/τδ, where the last inequality uses step 1.2.

step 1.2step 2.1L1L2algebra
4.1

Because Xi1X and vi has maximum degree in G[Xi1], we have xi=Ai/XϵδV(G)/Xϵ. Hence i=1sxi=i=1sxiτxi1τϵ1τi=1sxiτϵ(ϵδ)τ, and, because τ<1/2, i=1sxi1/2=i=1sxiτxi1/2τϵ1/2τi=1sxiτϵ1/2(ϵδ)τ.

step 3.2givenalgebra
5.1

Divide the partition identity in step 2.1 by X. Using step 3.1 and the bound on xi1/2 from step 4.1, we obtain 1=sX+i=1sxi+i=1sDiXsX+ϵ(ϵδ)τ+1920ϵ1/2i=1sxi1/2sX+(ϵ+1920)(ϵδ)τ. Combining this with steps 1.1 and 3.3 gives 1<211/τδ+(ϵ+1920)(ϵδ)τ<1, 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.

step 1.1step 3.3step 4.1discharge-contradiction

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