ExampleConstruction: AI-adaptedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-01

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.

Complete graphs form the hereditary class with forbidden basis ${{\overline{K}}_{2}}$

Statement

The class of finite complete graphs is hereditary, and its minimal forbidden induced-subgraph basis is ${{\overline{K}}_{2}}$ .

Facts & Assumptions

Given: The class $K$ of finite complete graphs.

[F1]

Every induced subgraph of a complete graph is complete (Empty and complete graphs, complete bipartite graphs, and the convention that $P_{n}$ and $C_{n}$ have $n$ vertices).

[F2]

A graph is not complete exactly when it has two nonadjacent vertices.

[F3]

A minimal forbidden graph is outside the class while all proper induced subgraphs are inside (Minimal forbidden induced subgraphs and forbidden bases).

[L1]

A hereditary class is determined by its unique minimal forbidden basis (Every hereditary graph class is determined by its unique minimal forbidden induced subgraphs).

[F4]

Heredity means closure under isomorphism and induced subgraphs (Hereditary graph classes).

Verification

technique · direct

1.1

The class $K$ is isomorphism-closed and closed under induced subgraphs, so it is hereditary.

F1F4

1.2

The graph ${\overline{K}}_{2}$ is not complete, while each of its proper induced subgraphs is $K_{0}$ or $K_{1}$ and is complete. Thus it is minimally forbidden.

1.3

Every noncomplete graph has two nonadjacent vertices, and they induce ${\overline{K}}_{2}$ . Hence avoiding ${\overline{K}}_{2}$ is equivalent to being complete.

2.1

Therefore ${{\overline{K}}_{2}}$ is the unique minimal forbidden basis of $K$ .

step 1.1step 1.2step 1.3L1∎

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 35 results over 16 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources

Valerio Boncompagni, On hereditary graph classes defined by forbidding Truemper configurations (PhD thesis, 2018) (standard reference, not scraped)

Complete graphs form the hereditary class with forbidden basis {K‾2}{K2​}