arXiv (All)
open access
The Keevash--Mubayi simplex-cluster conjecture
A $d$-simplex-cluster is a collection of $d+1$ distinct $k$-element sets with empty total intersection, nonempty intersection for every $d$ members, and union of size at most $2k$. We prove the simplex-cluster conjecture of Keevash and Mubayi, a common strengthening of the Erdős--Chvátal simplex con
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- The Erdős--Chvátal Simplex Conjecture#1083902
- Local Clique Covers and Chromatic Number#985390
- Identifying domatic partitions via graph dynamical systems#1083938
- A Near-Linear Element Kernel for \(d\)-Hitting Set#974083
- Opposition-based learning memetic algorithm for the maximum intersection of k-subsets problem#231625
Record · ID 1218302
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive