Lower bounds of tower type for Szemerédi's uniformity lemma
From MaRDI portal
Publication:1355452
DOI10.1007/PL00001621zbMath0876.05053WikidataQ55952695 ScholiaQ55952695MaRDI QIDQ1355452
Publication date: 25 November 1997
Published in: Geometric and Functional Analysis. GAFA (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Structure and regularity for subsets of groups with finite VC-dimension ⋮ NOTES ON THE STABLE REGULARITY LEMMA ⋮ Lower bounds for the smallest singular value of structured random matrices ⋮ Grothendieck-Type Inequalities in Combinatorial Optimization ⋮ A Folkman Linear Family ⋮ Minimum \(H\)-decompositions of graphs ⋮ A variant of the hypergraph removal lemma ⋮ Integer and fractional packings of hypergraphs ⋮ Improved Bound on the Maximum Number of Clique-Free Colorings with Two and Three Colors ⋮ On the Interplay Between Strong Regularity and Graph Densification ⋮ On two problems in graph Ramsey theory ⋮ Bounds for graph regularity and removal lemmas ⋮ Convolutions of sets with bounded VC-dimension are uniformly continuous ⋮ Diagonal Ramsey via effective quasirandomness ⋮ Tower-type bounds for Roth's theorem with popular differences ⋮ A unified view of graph regularity via matrix decompositions ⋮ A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing ⋮ Formalising Szemerédi's Regularity Lemma and Roth's Theorem on Arithmetic Progressions in Isabelle/HOL ⋮ Approximating the Rectilinear Crossing Number ⋮ An improved lower bound for arithmetic regularity ⋮ Local-vs-global combinatorics ⋮ An Optimal Algorithm for Finding Frieze–Kannan Regular Partitions ⋮ On Regularity Lemmas and their Algorithmic Applications ⋮ The Schur-Erdős problem for semi-algebraic colorings ⋮ A new proof of the graph removal lemma ⋮ Combinatorial and computational aspects of graph packing and graph decomposition ⋮ Extremal results in sparse pseudorandom graphs ⋮ Regular partitions of gentle graphs ⋮ Measure concentration and the weak Pinsker property ⋮ A Cryptographic View of Regularity Lemmas: Simpler Unified Proofs and Refined Bounds ⋮ Limitations on regularity lemmas for clustering graphs ⋮ The hypergraph regularity method and its applications ⋮ Efficient Testing without Efficient Regularity ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ A sparse regular approximation lemma ⋮ Graph summarization with quality guarantees ⋮ Hypergraph Packing and Sparse Bipartite Ramsey Numbers ⋮ Regularity lemmas for stable graphs ⋮ A short proof of Gowers' lower bound for the regularity lemma ⋮ Induced Ramsey-type theorems ⋮ The critical window for the classical Ramsey-Turán problem ⋮ On hereditarily indecomposable Banach spaces ⋮ Regularity lemmas for clustering graphs ⋮ On graphs with linear Ramsey numbers ⋮ Unnamed Item ⋮ \(p\)-arrangeable graphs are Folkman linear ⋮ Testing subgraphs in directed graphs ⋮ What is good mathematics? ⋮ On the relation of separability, bandwidth and embedding ⋮ A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma ⋮ The Induced Removal Lemma in Sparse Graphs ⋮ Unnamed Item ⋮ Estimating parameters associated with monotone properties ⋮ Cycle factors in dense graphs ⋮ Approximating the rectilinear crossing number ⋮ Quantitative structure of stable sets in arbitrary finite groups ⋮ A tight bound for hypergraph regularity ⋮ Large Book-Cycle Ramsey Numbers
