Alphabeta Math
CorollaryStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 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.

An H-free graph has a linearly large induced subgraph whose graph or complement has bounded maximum degree

Statement

For every finite graph H and every real ϵ>0, there exists δ>0 such that every nonempty H-free graph G contains a set XV(G) with XδV(G) for which one of G[X] or G[X] has maximum degree at most ϵδV(G).

Facts & Assumptions

Given: A finite graph H, a real ϵ>0, and a nonempty H-free graph G.

[L1]

For every graph H and every real η(0,12), there exists δ0>0 such that every nonempty H-free graph contains a set ZV(G) with Zδ0V(G) and either dG(Z,Z)η or dG(Z,Z)1η (The edge-density form of Rödl's theorem: every nonempty H-free graph has a linearly large set of self-density at most ϵ or at least 1ϵ).

[L2]

If a graph on n vertices has at most λn(n1)/2 edges, then for every integer m with 1m(n+1)/2 it has an m-vertex induced subgraph of maximum degree at most 4λ(m1) (A sparse graph has a prescribed-size induced subgraph of bounded maximum degree).

Proof

technique · direct
1.1

Put η:=ϵ/8. If η1/2, then ϵ4. The conclusion is trivial with δ:=1, because every induced subgraph has maximum degree at most V(G)1<V(G)ϵV(G)=ϵδV(G). So we may assume η<1/2, and [L1] gives δ0>0 for the parameter η. Set δ:=min{δ0,1}/2.

givenL1choosecases
2.1

Apply [L1] to the given nonempty H-free graph G. Then there is ZV(G) with Zδ0V(G)2δV(G) and either dG(Z,Z)η or dG(Z,Z)1η. Let m:=δV(G). Since Z is an integer and Z2δV(G), we have Z2δV(G)2m1, so m(Z+1)/2.

step 1.1L1choosealgebra
3.1

First suppose dG(Z,Z)η. Writing n:=Z, the definition of density gives 2E(G[Z])/n2η. If n=1, then m=1 and Z itself already has maximum degree 0ϵδV(G). If n2, then n22n(n1), so E(G[Z])ηn2/2(ϵ/4)n(n1)/2. Applying [L2] with λ=ϵ/4 gives a set XZ with X=m and maximum degree at most 4(ϵ/4)(m1)=ϵ(m1)ϵδV(G).

step 2.1L2algebracases
4.1

Now suppose instead that dG(Z,Z)1η. If n:=Z, then dG(Z,Z)=11ndG(Z,Z)η1nη. Applying step 3.1 to the complement graph on the same vertex set yields XZ with X=m such that G[X] has maximum degree at most ϵδV(G).

step 2.1step 3.1algebra
5.1

In either case there is a set X with X=mδV(G) such that one of G[X] or G[X] has maximum degree at most ϵδV(G).

step 3.1step 4.1cases-exhaustive

Depends on

Used by

Dependency tree · two levels

14 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