arXiv (All)
open access
Stable Regularity Lemmas: Efficient Algorithms and Essentially Tight Littlestone Bounds
In this paper, we determine the precise asymptotics of the number of parts of stable regularity equipartitions in terms of the Littlestone dimension: every graph $G$ of Littlestone dimension $\operatorname{Lit}(G)\leq\ell$ has a regular equipartition into excellent sets with $(1 + o_{ε\to 0,\ell}(1)
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
- Square root cancellation in the hyperbolic lattice counting problem over cocompact groups#1118902
- An extension of the Erdős-Tetali theorem#997872
- Finiteness of K-moduli compactifications under the boundedness of K-semistable degenerations#1118418
- A note on large clusters of $E_2$-numbers#1130129
- Resilience of rainbow Hamilton cycles in pseudorandom graphs#1062542
Record · ID 1051620
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