Szemerédi's Regularity Lemma for Matrices and Sparse Graphs
From MaRDI portal
Publication:2998854
DOI10.1017/S0963548310000490zbMath1231.05141arXiv1010.0628WikidataQ105583885 ScholiaQ105583885MaRDI QIDQ2998854
Publication date: 11 May 2011
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1010.0628
Related Items (30)
Cut distance identifying graphon parameters over weak* limits ⋮ A spanning bandwidth theorem in random graphs ⋮ Large monochromatic components and long monochromatic cycles in random hypergraphs ⋮ Graphons arising from graphs definable over finite fields ⋮ Local resilience for squares of almost spanning cycles in sparse random graphs ⋮ Turán numbers of bipartite graphs plus an odd cycle ⋮ Color‐biased Hamilton cycles in random graphs ⋮ Covering cycles in sparse graphs ⋮ A unified view of graph regularity via matrix decompositions ⋮ Bipartite-ness under smooth conditions ⋮ On some Multicolor Ramsey Properties of Random Graphs ⋮ Regularity lemmas in a Banach space setting ⋮ Extremal results in sparse pseudorandom graphs ⋮ Regular partitions of gentle graphs ⋮ Hyperfinite graphings and combinatorial optimization ⋮ On the KŁR conjecture in random graphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ The size Ramsey number of short subdivisions of bounded degree graphs ⋮ A sparse regular approximation lemma ⋮ Partitioning random graphs into monochromatic components ⋮ A weighted regularity lemma with applications ⋮ Regularity lemmas for clustering graphs ⋮ The analytic evolution of Dyson-Schwinger equations via homomorphism densities ⋮ An 𝐿^{𝑝} theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions ⋮ Cut-norm and entropy minimization over \(\text{weak}^{\ast}\) limits ⋮ Measures on the square as sparse graph limits ⋮ Independent sets in hypergraphs ⋮ The Approximate Loebl--Komlós--Sós Conjecture I: The Sparse Decomposition ⋮ The regularity method for graphs with few 4‐cycles ⋮ A relative Szemerédi theorem
Cites Work
This page was built for publication: Szemerédi's Regularity Lemma for Matrices and Sparse Graphs
