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 has property , with the special-vertex comb trigger in co-Bird-free graphs.
Facts & Assumptions
Given: An arbitrary co-Bird-free finite graph and an arbitrary special-vertex comb in it, with special vertex complete to and anticomplete to the teeth .
The -graph has the Erdős-Hajnal property: there is such that every nonempty -free graph has a clique or stable set of size at least (The -graph has the Erdős-Hajnal property).
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).
Let be an -comb in a finite simple co-Bird-free graph , and let be outside all teeth and blocks, complete to every and anticomplete to every tooth. For every there are disjoint sets with such that is -free, and has a partition into a nonempty ordered sequence of nonempty sets that is a pure blockade, whose pattern is -free, and such that each individual vertex of every other comb block is pure to each (A special-vertex co-Bird-free comb admits an E-free structural partition).
Special-vertex-local criterion: let have a common Erdős-Hajnal constant . Suppose that, in every -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 has property (The special-vertex-local structural-partition criterion implies property (*)).
Property for a finite family asks, for every -free graph containing an -comb with and a vertex outside all teeth and blocks complete to and anticomplete to , that one of three listed outcomes hold with constants (Property (*) for a finite graph family).
The structural comb-partition clauses are: (1) is -free; (2) has a nonempty-block pure-blockade partition whose pattern graph is -free; (3) every vertex of is pure to every block of that partition (The structural comb-partition hypothesis).
The Bird graph has vertex set and edge set , and co-Bird is its complement (The Bird graph and co-Bird).
The -graph has edge set , and co- is its complement (The -graph and co-).
A graph is -free when it has no induced copy of , and -free when it is -free for every (-free and -free graphs under the induced-subgraph convention).
A graph has the Erdős-Hajnal property when its class of -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
Take . By [L1] the class of -free graphs has an Erdős-Hajnal constant ; by [L2] the number lies in and is again an Erdős-Hajnal constant for that class, so and have the common constant .
Since co-Bird is by definition the complement of the Bird graph, [L7] gives ; hence the graphs quantified over in the definition [L5] for are exactly the co-Bird-free graphs.
For the arbitrary co-Bird-free graph and the arbitrary special-vertex comb of the statement, [L3] applies: is outside all teeth and blocks, complete to every and anticomplete to every tooth, exactly its hypothesis. It supplies, for every , disjoint sets with , an -free induced subgraph , and a partition of into a nonempty sequence of nonempty sets that is a pure blockade with -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 ; its second clause holds with , since the blocks are nonempty, they form a pure blockade, and the pattern is -free; and its third clause, purity of each block to every vertex of each other comb block, holds.
The hypothesis of the criterion [L4] is now verified for : the families have the common constant by step 1.1, and every special-vertex comb in every -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 has property .
The conclusion is property for the singleton family with its trigger read in co-Bird-free graphs, as recorded in step 1.2 and the definition [L5]; this is the statement.
Remarks
- The precise complement direction matters here: the trigger class is co-Bird-free, because property for is stated over graphs free of . 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- partition with the auxiliary family ; here the auxiliary family collapses to because the 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
- The $E$-graph has the Erdős-Hajnal property
- A special-vertex co-Bird-free comb admits an E-free structural partition
- The special-vertex-local structural-partition criterion implies property (*)
- Every smaller positive exponent is again an Erdős–Hajnal constant
- Property (*) for a finite graph family
- The Erdős–Hajnal property and an Erdős–Hajnal constant for a hereditary graph class
- The Bird graph and co-Bird
- The $E$-graph and co-$E$
- $H$-free and $\mathcal F$-free graphs under the induced-subgraph convention
- The structural comb-partition hypothesis
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
- Shenwei Huang, Yiao Ju, and Yidong Zhou, Erdős-Hajnal beyond the five-vertex path, Lemmas 5.1 and 6.5, Section 6.2 (standard reference, not scraped)