ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passaudited 2026-08-13

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.

$K_{3, 4}$ realises $ex (7, K_{3}) = 12$

Example

The complete bipartite graph $K_{3, 4}$ is triangle-free and has $3 \cdot 4 = 12$ edges. Hence it realizes

$ex (7, K_{3}) = ⌊ \frac{49}{4} ⌋ = 12.$

Facts & Assumptions

Given: The hypotheses and notation of the statement above.

[F1]

The complete bipartite graph $K_{A, B}$ has exactly all edges joining a vertex of $A$ to a vertex of $B$ (Empty and complete graphs, complete bipartite graphs, and the convention that $P_{n}$ and $C_{n}$ have $n$ vertices).

[F2]

For every $n \in N$ , Mantel's theorem gives $ex (n, K_{3}) = ⌊ n^{2} / 4 ⌋$ , and a triangle-free $n$ -vertex graph attains equality exactly when it is the balanced complete bipartite graph up to isomorphism (Mantel's theorem: $ex (n, K_{3}) = ⌊ n^{2} / 4 ⌋$ , uniquely attained by $T_{n, 2}$ ).

Verification

technique · count cross edges and apply Mantel

1.1

Every edge of $K_{3, 4}$ crosses its bipartition, so a three-vertex cycle is impossible, and there are exactly $3 \cdot 4 = 12$ possible cross edges.

givenF1

2.1

Mantel's theorem gives the matching upper bound $⌊ 7^{2} / 4 ⌋ = 12$ , so the graph is extremal.

step 1.1givenF2∎

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

9 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

Yufei Zhao, Graph Theory and Additive Combinatorics (standard reference, not scraped)

K3,4K3,4​ realises ex⁡(7,K3)=12ex(7,K3​)=12