scientific article; zbMATH DE number 5043458
From MaRDI portal
Publication:5480762
zbMath1093.05030arXivmath/0504472MaRDI QIDQ5480762
Publication date: 3 August 2006
Full work available at URL: https://arxiv.org/abs/math/0504472
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Additive bases, including sumsets (11B13) Arithmetic progressions (11B25) Cyclic codes (94B15)
Related Items (25)
Szemerédi's regularity lemma via martingales ⋮ Gaussian bounds for noise correlation of functions ⋮ Weak hypergraph regularity and applications to geometric Ramsey theory ⋮ Limits of discrete distributions and Gibbs measures on random graphs ⋮ Bounds for graph regularity and removal lemmas ⋮ Concentration estimates for functions of finite high‐dimensional random arrays ⋮ Interview with Victor Reiner ⋮ A concentration inequality for product spaces ⋮ A combinatorial proof of the Burdzy-Pitman conjecture ⋮ Formalising Szemerédi's Regularity Lemma and Roth's Theorem on Arithmetic Progressions in Isabelle/HOL ⋮ A quantitative version of the non-Abelian idempotent theorem ⋮ Cycles and Matchings in Randomly Perturbed Digraphs and Hypergraphs ⋮ A multidimensional Szemerédi theorem in the primes via combinatorics ⋮ Proof mining and effective bounds in differential polynomial rings ⋮ Regularity lemmas in a Banach space setting ⋮ Regular partitions of gentle graphs ⋮ Measure concentration and the weak Pinsker property ⋮ A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal Lemma ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ A sparse regular approximation lemma ⋮ Non-conventional ergodic averages for several commuting actions of an amenable group ⋮ Monochromatic sums and products ⋮ A characterization of constant‐sample testable properties ⋮ Highly connected coloured subgraphs via the regularity Lemma ⋮ A tight bound for hypergraph regularity
This page was built for publication:
