Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-sol)audited 2026-09-27
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.

The singleton Bird family has property (*)

Statement

The singleton finite family {Bird} has property (∗), with the special-vertex comb trigger in co-Bird-free graphs.

Facts & Assumptions

Given: An arbitrary co-Bird-free finite graph G and an arbitrary special-vertex comb in it, with special vertex v complete to ⋃iBi and anticomplete to the teeth {ai}.

[L1]

The E-graph has the Erdős-Hajnal property: there is ϵE>0 such that every nonempty E-free graph has a clique or stable set of size at least ∣V(G)∣ϵE (The E-graph has the Erdős-Hajnal property).

[L2]

Every positive exponent below an Erdős-Hajnal constant of a hereditary class is again one (Every smaller positive exponent is again an Erdős–Hajnal constant).

[L3]

Let ((ak,Bk):k∈[ℓ]) be an (ℓ,w)-comb in a finite simple co-Bird-free graph G, and let v be outside all teeth and blocks, complete to every Bk and anticomplete to every tooth. For every i there are disjoint sets Xi,Yi with Bi=Xi∪Yi such that G[Yi] is E-free, and Xi has a partition into a nonempty ordered sequence (A1i,…,Atii) of nonempty sets that is a pure blockade, whose pattern is E-free, and such that each individual vertex of every other comb block is pure to each Aji (A special-vertex co-Bird-free comb admits an E-free structural partition).

[L4]

Special-vertex-local criterion: let F1,F2 have a common Erdős-Hajnal constant c∈(0,1]. Suppose that, in every H‾-free graph, every special-vertex comb occurring in the definition of property (∗) has a partition satisfying clauses (1) and (2.1)--(2.3) of the structural comb partition. Then H has property (∗) (The special-vertex-local structural-partition criterion implies property (*)).

[L5]

Property (∗) for a finite family F asks, for every F‾-free graph containing an (ℓ,w)-comb with ℓ,w≥4 and a vertex v outside all teeth and blocks complete to ⋃iBi and anticomplete to {ai}, that one of three listed outcomes hold with constants c1,c2,c3>0 (Property (*) for a finite graph family).

[L6]

The structural comb-partition clauses are: (1) Yi is F1-free; (2) Xi has a nonempty-block pure-blockade partition whose pattern graph is F2-free; (3) every vertex of ⋃k≠iBk is pure to every block of that partition (The structural comb-partition hypothesis).

[L7]

The Bird graph has vertex set {x1,x2,x3,y,z,w} and edge set {x1x2,x2x3,x1x3,x1y,x2z,yw}, and co-Bird is its complement (The Bird graph and co-Bird).

[L8]

The E-graph has edge set {p1p2,p2p3,p3p4,p4p5,p3q}, and co-E is its complement (The E-graph and co-E).

[L9]

A graph is H-free when it has no induced copy of H, and F-free when it is H-free for every H∈F (H-free and F-free graphs under the induced-subgraph convention).

[L10]

A graph H has the Erdős-Hajnal property when its class of H-free graphs has an Erdős-Hajnal constant, and the same applies to a finite family through its family-free class (The Erdős–Hajnal property and an Erdős–Hajnal constant for a hereditary graph class).

Proof

technique · direct: fix the common constant for $\mathcal F_1=\mathcal F_2=\{E\}$, verify the local partition for co-Bird-free graphs, and apply the published local criterion
1.1

Take F1=F2={E}. By [L1] the class of E-free graphs has an Erdős-Hajnal constant ϵE>0; by [L2] the number c:=min⁡{ϵE,1} lies in (0,1] and is again an Erdős-Hajnal constant for that class, so F1 and F2 have the common constant c∈(0,1].

L1L2L10given
1.2

Since co-Bird is by definition the complement of the Bird graph, [L7] gives {Bird}‾={co-Bird}; hence the graphs quantified over in the definition [L5] for F={Bird} are exactly the co-Bird-free graphs.

L5L7
1.3

For the arbitrary co-Bird-free graph G and the arbitrary special-vertex comb of the statement, [L3] applies: v is outside all teeth and blocks, complete to every Bk and anticomplete to every tooth, exactly its hypothesis. It supplies, for every i, disjoint sets Xi,Yi with Bi=Xi∪Yi, an E-free induced subgraph G[Yi], and a partition of Xi into a nonempty sequence (A1i,…,Atii) of nonempty sets that is a pure blockade with E-free pattern, every block being pure to each individual vertex of the other comb blocks. Matching this with the numbered clauses of [L6]: its first clause holds with F1={E}; its second clause holds with F2={E}, since the blocks are nonempty, they form a pure blockade, and the pattern is E-free; and its third clause, purity of each block to every vertex of each other comb block, holds.

L3L6L8L9given
2.1

The hypothesis of the criterion [L4] is now verified for H={Bird}: the families F1=F2={E} have the common constant c∈(0,1] by step 1.1, and every special-vertex comb in every H‾-free graph, i.e. in every co-Bird-free graph by step 1.2, admits the partition of step 1.3. Therefore [L4] gives that {Bird} has property (∗).

L4step 1.1step 1.2step 1.3
3.1

The conclusion is property (∗) for the singleton family {Bird} with its trigger read in co-Bird-free graphs, as recorded in step 1.2 and the definition [L5]; this is the statement.

step 2.1L5step 1.2∎

Remarks

  • The precise complement direction matters here: the trigger class is co-Bird-free, because property (∗) for {Bird} is stated over graphs free of Bird‾. The source's Section 6.2 heading says "Bird graph" while its Lemma 6.5 and its use are for co-Bird-free graphs; the scaffold ledger already records that correction, and this corollary follows the lemma.
  • The companion E corollary uses the analogous co-E partition with the auxiliary family {H5,co-E}; here the auxiliary family collapses to F1=F2={E} because the E theorem is available as auxiliary input.
  • No Choice. The argument instantiates published finite criteria and selects nothing from any family of nonempty sets.

Depends on

Used by

Dependency tree · two levels

35 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