Extremal problems on set systems

DOI10.1002/rsa.10017zbMath0995.05141OpenAlexW2528567371MaRDI QIDQ4543625

Publication date: 8 August 2002

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.10017

zbMATH Keywords

regularity lemma Szemerédi's theorem

Mathematics Subject Classification ID

Hypergraphs (05C65) Extremal set theory (05D05)

Related Items

Additive combinatorics and graph theory, Additive approximation of generalized Turán questions, On characterizing hypergraph regularity, Integer and fractional packings in dense 3‐uniform hypergraphs, Density theorems and extremal hypergraph problems, Regularity Lemma for k-uniform hypergraphs, Counting in hypergraphs via regularity inheritance, Embedding tetrahedra into quasirandom hypergraphs, A variant of the hypergraph removal lemma, Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree, Hamiltonian paths and cycles in some 4-uniform hypergraphs, Small cores in 3-uniform hypergraphs, Integer and fractional packings of hypergraphs, σ-algebras for quasirandom hypergraphs, Constructive Packings of Triple Systems, Extremal problems in uniformly dense hypergraphs, The number of 3-SAT functions, Formalising Szemerédi's Regularity Lemma and Roth's Theorem on Arithmetic Progressions in Isabelle/HOL, Some Cubic Time Regularity Algorithms for Triple Systems, Local-vs-global combinatorics, Almost all triple systems with independent neighborhoods are semi-bipartite, The (7, 4)-Conjecture in Finite Groups, Hypergraphs with vanishing Turán density in uniformly dense hypergraphs, Almost all triangle-free triple systems are tripartite, Counting configuration-free sets in groups, Unnamed Item, A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal Lemma, Sparse hypergraphs: new bounds and constructions, The hypergraph regularity method and its applications, Regularity, uniformity, and quasirandomness, A sparse regular approximation lemma, Constructive Packings by Linear Hypergraphs, Note on the 3-graph counting Lemma, The Ramsey Number for 3-Uniform Tight Hypergraph Cycles, An analytic approach to sparse hypergraphs: hypergraph removal, An approximate Dirac-type theorem for \(k\)-uniform hypergraphs, The Gaussian primes contain arbitrarily shaped constellations, A removal lemma for systems of linear equations over finite fields, Weak hypergraph regularity and linear hypergraphs, 3-uniform hypergraphs of bounded degree have linear Ramsey numbers, Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs, Testing Linear-Invariant Non-linear Properties: A Short Report, Green’s Conjecture and Testing Linear Invariant Properties, An approximate logic for measures, Short paths in quasi-random triple systems with sparse underlying graphs, Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs, Generalizations of the removal lemma, Ramsey properties of random discrete structures, Roth-type theorems in finite groups, Graph norms and Sidorenko's conjecture, Regularity properties for triple systems, Hereditary properties of hypergraphs, Hypergraphs without exponents, Arithmetic progressions, different regularity lemmas and removal lemmas, On the Ramsey number of sparse 3-graphs, A combinatorial proof of the removal lemma for groups, A hypergraph blow-up lemma, Hamiltonian cycles above expectation in \(r\)-graphs and quasi-random \(r\)-graphs, A geometric theory for hypergraph matching, On a Turán-type hypergraph problem of Brown, Erdős and T. Sós, Weak quasi-randomness for uniform hypergraphs, The quasi-randomness of hypergraph cut properties, A tight bound for hypergraph regularity, Minimum Vertex Degree Threshold for ‐tiling*, Complete Partite subgraphs in dense hypergraphs, A relative Szemerédi theorem, The Ramsey number for hypergraph cycles. I.

Cites Work