Restricted problems in extremal combinatorics
From MaRDI portal
Recommendations
Cites work
- A density version of the Hales-Jewett theorem
- A measure-theoretic approach to the theory of dense hypergraphs
- A new generalization of the Erdős-Ko-Rado theorem
- A new proof of Szemerédi's theorem
- An ergodic Szemerédi theorem for commuting transformations
- An exact result for 3-graphs
- Embedding tetrahedra into quasirandom hypergraphs
- Ergodic behavior of diagonal measures and a theorem of Szemeredi on arithmetic progressions
- Extremal problems in uniformly dense hypergraphs
- Flag algebras
- scientific article; zbMATH DE number 5942358 (Why is no real title available?)
- scientific article; zbMATH DE number 4027516 (Why is no real title available?)
- scientific article; zbMATH DE number 4099367 (Why is no real title available?)
- scientific article; zbMATH DE number 3641497 (Why is no real title available?)
- scientific article; zbMATH DE number 4196000 (Why is no real title available?)
- scientific article; zbMATH DE number 3285073 (Why is no real title available?)
- scientific article; zbMATH DE number 3041944 (Why is no real title available?)
- scientific article; zbMATH DE number 3071148 (Why is no real title available?)
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Hypergraphs do jump
- Hypergraphs do not jump
- Hypergraphs with vanishing Turán density in uniformly dense hypergraphs
- Hypergraphs, quasi-randomness, and conditions for regularity
- Large networks and graph limits
- Limits of dense graph sequences
- On 3-hypergraphs with forbidden 4-vertex configurations
- On a generalisation of Mantel’s Theorem to Uniformly Dense Hypergraphs
- On a Turán problem in weakly quasirandom 3-uniform hypergraphs
- On Certain Sets of Integers
- On extremal problems of graphs and generalized graphs
- On possible Turán densities
- On Ramsey - Turan type theorems for hypergraphs
- On sets of integers containing k elements in arithmetic progression
- On the structure of linear graphs
- On universality of graphs with uniformly distributed edges
- Paul turán, 1910–1976: His work in graph theory
- Quasi-random graphs
- Regularity Lemma for k-uniform hypergraphs
- Roth's theorem on progressions revisited
- Some remarks on _
- Supersaturation for Ramsey-Turán problems
- The counting lemma for regular k‐uniform hypergraphs
- The primes contain arbitrarily long arithmetic progressions
- Three-graphs without two triples whose symmetric difference is contained in a third
This page was built for publication: Restricted problems in extremal combinatorics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6198640)