An improved bound for regular decompositions of 3-uniform hypergraphs of bounded VC₂-dimension
From MaRDI portal
Publication:6628971
DOI10.2140/MT.2023.2.325MaRDI QIDQ6628971FDOQ6628971
Publication date: 29 October 2024
Published in: Model Theory (Search for Journal in Brave)
Classification theory, stability, and related concepts in model theory (03C45) Extremal combinatorics (05D99)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Regularity Lemma for k-uniform hypergraphs
- Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension
- Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
- Strongly dependent theories
- Bounds for graph regularity and removal lemmas
- Extremal problems on set systems
- On \(n\)-dependent groups and fields
- Regularity partitions and the topology of graphons
- Lower bounds of tower type for Szemerédi's uniformity lemma
- A tight bound for hypergraph regularity
- Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs
- Erdős-Hajnal conjecture for graphs with bounded VC-dimension
- A short proof of Gowers' lower bound for the regularity lemma
- A tight lower bound for Szemerédi's regularity lemma
- On \(n\)-dependence
- 𝑉𝐶_{ℓ}-dimension and the jump to the fastest speed of a hereditary ℒ-property
- Counting subgraphs in quasi‐random 4‐uniform hypergraphs
- Onn-dependent groups and fields II
This page was built for publication: An improved bound for regular decompositions of 3-uniform hypergraphs of bounded \(\mathrm{VC}_2\)-dimension
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6628971)
