Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-09
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.

Local special copy trichotomy

Statement

Let H be a nonempty finite graph, g∈V(H), h=∣H∣, b,c>0, and a=b+(1+c)h. Let 0<x≤1/2 and let A,B be disjoint vertex subsets of a finite graph G, such that every v∈A has at least x∣B∣ nonneighbors in B. At least one of the following holds:

  • Some B′⊆B has ∣B′∣≥x∣B∣ and ind⁡H−g(G[B′])<xb∣B′∣h−1.
  • ind⁡H(G)≥xa∣A∣∣B∣h−1.
  • Some A′⊆A, B′⊆B have ∣A′∣≥xa∣A∣, ∣B′∣≥xa∣B∣ and eG(A′,B′)≤2xc∣A′∣∣B′∣.

Integer powers use the empty-function convention 00=1.

Facts & Assumptions

Given: H,g,h,b,c,a,x,A,B,G as in the statement, with the stated nonneighbor bound.

[F1]
[F2]

For finite sets X,Y and a relation R⊆X×Y, ∑x∈X∣Rx∣  =  ∣R∣  =  ∑y∈Y∣Ry∣. (Double counting: ∑x∈X∣Rx∣=∣R∣=∑y∈Y∣Ry∣ for a relation between finite sets).

Proof

1.1given

If A=∅, the second lower bound is zero. If B=∅ and h≥2, it is also zero. If h=1, then ind⁡H(G)=∣G∣≥∣A∣≥xa∣A∣ even when B is empty. Hence assume A,B nonempty and h≥2, and that the first and second alternatives both fail.

2.1F2step 1.1

List the edges at g as gh1,…,ghd, and let Hr retain precisely the first r of them, with all other adjacencies unchanged. Count special induced embeddings of Hr taking g to A and other labels to B; denote the number by τr. For each v∈A, its nonneighbor set Bv has ∣Bv∣≥x∣B∣. Failure of the first alternative gives at least xb∣Bv∣h−1≥xb+h−1∣B∣h−1 embeddings of H−g there. Extending by g↦v and summing disjoint fibres by [F2] yields τ0≥xb+h−1M, where M=∣A∣∣B∣h−1>0.

3.1step 2.1algebra

Failure of the second alternative gives τd<xaM≤xb+h−1+cdM, since d≤h−1. Thus d>0 and there is a first r∈{1,…,d} with τr<xb+h−1+crM. Its predecessor satisfies τr−1≥xb+h−1+c(r−1)M≥2xaM>0, since a−(b+h−1+c(r−1))=1+c(h−r+1)≥1 and x≤1/2. Also τr<xcτr−1.

4.1F2step 3.1

Put w=hr. For each induced embedding ψ of H−{g,w} into B, let Uψ⊆B∖im⁡ψ contain the valid images of w for H−g. Let Vψ⊆A contain the valid images of g for Hr−1−w, using this intermediate graph, not H−w. Let nψ and eψ count respectively nonedges and edges between Vψ,Uψ. The only remaining pair is gw: a nonedge completes Hr−1 and an edge completes Hr. Conversely every special embedding restricts to exactly one such ψ. Therefore [F2] gives ∑nψ=τr−1 and ∑eψ=τr.

5.1F1step 3.1step 4.1

There are at most ∣B∣h−2 possible ψ by [F1]. Discard those with nψ<τr−1/(2∣B∣h−2). Their total is at most τr−1/2, so the retained family has total at least τr−1/2>0. If every retained ψ had eψ>2xcnψ, summing would give τr>xcτr−1, impossible. Some retained ψ therefore has eψ≤2xcnψ.

6.1step 5.1step 3.1algebra∎

For this ψ, ∣Uψ∣∣Vψ∣≥nψ≥τr−1/(2∣B∣h−2)≥xa∣A∣∣B∣. Since ∣Uψ∣≤∣B∣ and ∣Vψ∣≤∣A∣, this implies ∣Vψ∣≥xa∣A∣ and ∣Uψ∣≥xa∣B∣. Moreover eψ≤2xcnψ≤2xc∣Uψ∣∣Vψ∣. Set A′=Vψ, B′=Uψ. These satisfy the third alternative and complete the proof.

Source notes

Proof/convention locator: Bucic, Nguyen, Scott and Seymour, Induced subgraph density I, 3.1 complete proof.

Depends on

Used by

Dependency tree · two levels

28 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