CounterexampleConstruction: Literature-sourcedVerification: AI-generatedprecheck passaudited 2026-08-16

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 half graph has no regularity across its natural bipartition at a fixed small parameter

Statement

Let $X_{n} = {a_{1}, \dots, a_{n}}$ and $Y_{n} = {b_{1}, \dots, b_{n}}$ , with $a_{i} b_{j}$ an edge exactly when $i \leq j$ . For every $n \geq 4$ , the natural pair $(X_{n}, Y_{n})$ is not $1 / 5$ -regular.

Facts & Assumptions

Given: The displayed bipartite half graph.

[L1]

Failure of $ϵ$ -regularity is witnessed by subsets of relative size at least $ϵ$ whose density differs from the full-pair density by more than $ϵ$ ( $ϵ$ -regular pairs and self-regular vertex sets).

[L2]

A bipartite graph has no edges within either of its two specified sides (Empty and complete graphs, complete bipartite graphs, and the convention that $P_{n}$ and $C_{n}$ have $n$ vertices).

Counterexample

technique · direct

1.1givenalgebra

The number of cross-edges is $n + (n - 1) + \dots + 1 = n (n + 1) / 2$ , so $d (X_{n}, Y_{n}) = (n + 1) / (2 n)$ .

1.2givenL2choosealgebra

Put $q = ⌈ n / 4 ⌉$ , $A = {a_{1}, \dots, a_{q}}$ , and $B = {b_{n - q + 1}, \dots, b_{n}}$ . Then $∣ A ∣, ∣ B ∣ \geq n / 4 > n / 5$ , and every $a_{i} \in A$ satisfies $i \leq j$ for every $b_{j} \in B$ , so $d (A, B) = 1$ .

2.1step 1.1step 1.2L1algebra∎

For $n \geq 4$ , one has $∣ d (A, B) - d (X_{n}, Y_{n}) ∣ = (n - 1) / (2 n) \geq 3 / 8 > 1 / 5$ . Together with the size bounds in step 1.2, [L1] shows that $(X_{n}, Y_{n})$ is not $1 / 5$ -regular.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

7 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

Y. Zhao, Graph Theory and Additive Combinatorics, sec. 2.1 (standard reference, not scraped)