Local-vs-global combinatorics (Q6198642): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.4171/icm2022/36 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.4171/icm2022/36 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4389774850 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing subgraphs in large graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Algorithmic Aspects of the Regularity Lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient testing of large graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easily Testable Graph Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an extremal hypergraph problem of Brown, Erdős and Sós / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Characterization of the (Natural) Graph Properties Testable with One-Sided Error / rank
 
Normal rank
Property / cites work
 
Property / cites work: A separation theorem in property testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additive approximation for edge-deletion problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many \(T\) copies in \(H\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof verification and the hardness of approximation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic checking of proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testability and repair of hereditary hypergraph properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Sets of Integers Which Contain No Three Terms in Arithmetical Progression / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified framework for testing linear‐invariant properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-testing/correcting with applications to numerical problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pentagons vs. triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph limits and parameter testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of triangulated spheres in 3-graphs, and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5672676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for graph regularity and removal lemmas / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new bound for the Brown-Erdős-Sós problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4061052 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing versus Estimation of Graph Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new proof of the graph removal lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: The removal lemma for tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight bound for Green's arithmetic triangle removal lemma in vector spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight lower bound for Szemerédi's regularity lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal problems on set systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quick approximation to matrices and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform hypergraphs containing no grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ergodic behavior of diagonal measures and a theorem of Szemeredi on arithmetic progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An ergodic Szemerédi theorem for commuting transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient removal without efficient regularity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Generalized Turán Problem and its Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing dense grid-free linear $3$-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Removal lemmas with polynomial bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing graphs against an unknown distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing linear inequalities of subgraph statistics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Property Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing graphs in vertex-distribution-free models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Property testing and its connection to learning and approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-sided error proximity oblivious testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds of tower type for Szemerédi's uniformity lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new proof of Szemerédi's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraph regularity and the multidimensional Szemerédi theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The length of an <i>s</i>-increasing sequence of <i>r</i>-tuples / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Szemerédi-type regularity lemma in abelian groups, with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The primes contain arbitrarily long arithmetic progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Maximum Number of Triangles in <i>C</i><sub>2<i>k</i>+1</sub>-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Graph Partitions for Approximation and Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Query Complexity of Estimating the Distance to Hereditary Graph Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Wowzer-type lower bound for the strong regularity lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549724 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial proof of the removal lemma for groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: A removal lemma for systems of linear equations over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4899293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Szemerédi's lemma for the analyst / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof of Gowers' lower bound for the regularity lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sparse regular approximation lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight bound for hypergraph regularity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The counting lemma for regular <i>k</i>‐uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of the Brown–Erdős–Sós conjecture in groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs with small subgraphs of large chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular Partitions of Hypergraphs: Counting Lemmas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular Partitions of Hypergraphs: Regularity Lemmas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalizations of the removal lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3060865 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularity Lemma for k-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Certain Sets of Integers (II) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Characterizations of Polynomials with Applications to Program Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a linear equation in a set of integers I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4175585 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Induced Removal Lemma in Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of the Ruzsa-Szemerédi theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Hypergraphs with Applications to Coding Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of Green's conjecture regarding the removal properties of sets of linear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Ramsey variant of the Brown–Erdős–Sós conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small cores in 3-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on a Question of Erdős and Graham / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sets of integers containing no four elements in arithmetic progression / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sets of integers containing k elements in arithmetic progression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4200109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5421714 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variant of the hypergraph removal lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3768936 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.4171/ICM2022/36 / rank
 
Normal rank

Latest revision as of 19:23, 30 December 2024

scientific article; zbMATH DE number 7821708
Language Label Description Also known as
English
Local-vs-global combinatorics
scientific article; zbMATH DE number 7821708

    Statements

    Local-vs-global combinatorics (English)
    0 references
    0 references
    20 March 2024
    0 references
    Summary: Many of the most outstanding open problems in combinatorics relate the local and global properties of large discrete structures. The research aimed at solving these questions led to some of the most important developments in this area, as well as in related areas such as theoretical computer science, additive number theory, and harmonic analysis. In this paper we discuss some of these advances and mention several open problems. For the entire collection see [Zbl 07816360].
    0 references
    regularity lemma
    0 references
    quasi randomness
    0 references
    removal lemma
    0 references
    property testing
    0 references
    hypergraphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references