arXiv (All)
open access
Solution of uniform Turán's Tetrahedron Problem
Turán's Tetrahedron Problem asks to determine the Turán density of the complete hypergraph $K_4^{(3)}$ (tetrahedron). This problem, posed by Turán in 1941, is one of the most famous problems in extremal combinatorics and its solution would attract \$500 prize from Erdős. In the 1980s, Erdős and Sós
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
- A New Upper Bound for the Turán Density of the Tetrahedron#1064039
- Framing Triangulations for Arbitrary Integer Flow Polytopes#635846
- Framing Triangulations for Arbitrary Integer Flow Polytopes#633497
- Sylvester simplices: Triangulations and Ehrhart-theoretic aspects#1049446
- Cíclica: plan de negocios#1038147
Record · ID 999313
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