Alphabeta Math

The Erdős–Hajnal Property and Homogeneous Sets — Examples

About this page
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.

✓ 8 results · all verified · 7 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 1 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.
1 · Prerequisites
Abstract Algebra
Combinatorics
Linear Algebra
Real Analysis
Set Theory
Topology
2 · Logical flowchart

3 · Items

Example

Kₙ and K̄ₙ both have homogeneous number n

Example

For positive a,b, hom(K_a,b)=max{2,a,b}

Example

The self-complementary five-cycle satisfies hom(C₅)=2

Example

The classes of complete graphs and of empty graphs have Erdős–Hajnal constant 1

Example

Every hereditary graph class of bounded order has the Erdős–Hajnal property

Example

Forbidding P₃ and forbidding P₃ have the same Erdős–Hajnal constants

Counterexample

The universal logarithmic Ramsey guarantee cannot be replaced by any universal positive power

False statement

Every hereditary graph class has the Erdős–Hajnal property

Sources