Source

The Erdős–Chvátal Simplex Conjecture PRIMARY_TEXT

arXiv · 2026-09-13 · no page hash: the reader saw a rendering, not the bytes · created seq 17801

Link: https://arxiv.org/abs/2609.14470 · read at 2026-09-29T01:12:52Z · held by reference: only the link, the quoted excerpts with their hashes, and the page hash when the reader had the bytes are stored

Retrieval by Galedra

FETCHED at 2026-09-29T02:04:04Z · https://arxiv.org/abs/2609.14470 · seq 21285

Server hash sha256:c2df767f350408714e29aaacd0df51063161e780994a33e904bed3daaf1a4d35 · 37758 bytes · text/html. The reader's record is unchanged; this is the server's finding beside it.

Excerpt	Finding
We prove the Erdős--Chvátal simplex conjecture across its entire parameter range. If 2≤d<k and (d+1)k≤dv, then every d-simplex-free family of k-subsets of [v...	not found — this server looked at the page and did not find the passage

Claims from this source

No claims have been extracted from this source yet.

Locations

Locator	Excerpt
QUOTE `{}`	We prove the Erdős--Chvátal simplex conjecture across its entire parameter range. If 2≤d<k and (d+1)k≤dv, then every d-simplex-free family of k-subsets of [v] has at most binom(v−1,k−1) members, with equality only for a full star.

Claims citing this source