arXiv (All)
open access
A note on the Kővári--Sós--Turán theorem for stable hypergraphs
In this note, we prove a stronger version of the Kővári-Sós-Turán theorem for partition-wise $k$-stable $r$-hypergraphs. More precisely, we show that for every $k,r\in\mathbb{N}_{\geq 2}$ there is $η=η(r,k)>0$ such that if $H=(V;E)$ is a partition-wise $k$-stable $r$-uniform $K^{(r)}_{t,\ldots,t}$-f
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
- Forbidding $r$-extension of $C_4$ -- a counterexample of the Anstee-Sali conjecture#1324588
- Ramsey properties of maximal (outer)planar graphs#972204
- Every graph is eventually Turán-good#1312275
- The quadratic Brown--Erdős--Sós problem for 3-uniform hypergraphs with 8 and 9 edges#1188001
- A variational principle for Gaussian lattice sums#1201815
Record · ID 1215775
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