Restricted problems in extremal combinatorics
From MaRDI portal
Publication:6198640
DOI10.4171/icm2022/193OpenAlexW4389774928MaRDI QIDQ6198640
Publication date: 20 March 2024
Published in: International Congress of Mathematicians (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4171/icm2022/193
Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A problem of Erdős and Sós on 3-graphs
- Embedding tetrahedra into quasirandom hypergraphs
- A measure-theoretic approach to the theory of dense hypergraphs
- On possible Turán densities
- An exact result for 3-graphs
- Supersaturation for Ramsey-Turán problems
- Limits of dense graph sequences
- Roth's theorem on progressions revisited
- On universality of graphs with uniformly distributed edges
- Hypergraphs do not jump
- An ergodic Szemerédi theorem for commuting transformations
- Three-graphs without two triples whose symmetric difference is contained in a third
- Ergodic behavior of diagonal measures and a theorem of Szemeredi on arithmetic progressions
- Hypergraphs, quasi-randomness, and conditions for regularity
- On a Turán problem in weakly quasirandom 3-uniform hypergraphs
- A density version of the Hales-Jewett theorem
- On Ramsey - Turan type theorems for hypergraphs
- Extremal problems in uniformly dense hypergraphs
- The primes contain arbitrarily long arithmetic progressions
- On extremal problems of graphs and generalized graphs
- Hypergraph regularity and the multidimensional Szemerédi theorem
- On 3-Hypergraphs with Forbidden 4-Vertex Configurations
- Hypergraphs Do Jump
- On sets of integers containing k elements in arithmetic progression
- Paul turán, 1910–1976: His work in graph theory
- Hypergraphs with vanishing Turán density in uniformly dense hypergraphs
- On a generalisation of Mantel’s Theorem to Uniformly Dense Hypergraphs
- Some Remarks on π
- Regularity Lemma for k-uniform hypergraphs
- Flag algebras
- The counting lemma for regular k‐uniform hypergraphs
- On Certain Sets of Integers
- On the structure of linear graphs
- Quasi-random graphs
- A new generalization of the Erdős-Ko-Rado theorem
- A new proof of Szemerédi's theorem
