An improved bound for regular decompositions of 3-uniform hypergraphs of bounded VC₂-dimension
From MaRDI portal
Publication:6628971
Cites work
- \(\mathrm{VC}_{\ell }\)-dimension and the jump to the fastest speed of a hereditary \(\mathcal {L}\)-property
- A short proof of Gowers' lower bound for the regularity lemma
- A tight bound for hypergraph regularity
- A tight lower bound for Szemerédi's regularity lemma
- Bounds for graph regularity and removal lemmas
- Counting subgraphs in quasi‐random 4‐uniform hypergraphs
- Definable groups for dependent and 2-dependent theories
- Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs
- Erdős-Hajnal conjecture for graphs with bounded VC-dimension
- Extremal problems on set systems
- scientific article; zbMATH DE number 3641497 (Why is no real title available?)
- Hypergraph regularity and quasi-randomness
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Lower bounds of tower type for Szemerédi's uniformity lemma
- On n-dependence
- On n-dependent groups and fields
- Onn-dependent groups and fields II
- Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
- Regularity Lemma for k-uniform hypergraphs
- Regularity partitions and the topology of graphons
- Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension
- Strongly dependent theories
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)
