Pages that link to "Item:Q682130"
From MaRDI portal
The following pages link to A short proof of Gowers' lower bound for the regularity lemma (Q682130):
Displaying 15 items.
- Limitations on regularity lemmas for clustering graphs (Q2221793) (← links)
- Approximating the rectilinear crossing number (Q2331210) (← links)
- A tight bound for hypergraph regularity (Q2334614) (← links)
- A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing (Q2956040) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- A sparse regular approximation lemma (Q4633762) (← links)
- Efficient Testing without Efficient Regularity (Q4993324) (← links)
- An improved lower bound for arithmetic regularity (Q5360402) (← links)
- On Regularity Lemmas and their Algorithmic Applications (Q5366957) (← links)
- Holes in graphs (Q5954318) (← links)
- Tower-type bounds for Roth's theorem with popular differences (Q6056476) (← links)
- A unified view of graph regularity via matrix decompositions (Q6074704) (← links)
- Some Cubic Time Regularity Algorithms for Triple Systems (Q6188523) (← links)
- Local-vs-global combinatorics (Q6198642) (← links)
- An improved bound for regular decompositions of 3-uniform hypergraphs of bounded \(\mathrm{VC}_2\)-dimension (Q6628971) (← links)
