The following pages link to Extremal problems on set systems (Q4543625):
Displaying 50 items.
- Counting in hypergraphs via regularity inheritance (Q322280) (← links)
- Embedding tetrahedra into quasirandom hypergraphs (Q326814) (← links)
- Small cores in 3-uniform hypergraphs (Q345139) (← links)
- Almost all triangle-free triple systems are tripartite (Q452822) (← links)
- Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs (Q544011) (← links)
- An extension of the Ruzsa-Szemerédi theorem (Q558315) (← links)
- On maximal weakly separated set-systems (Q604830) (← links)
- Arithmetic progressions, different regularity lemmas and removal lemmas (Q746166) (← links)
- The Ramsey number for hypergraph cycles. I. (Q817613) (← links)
- Additive approximation of generalized Turán questions (Q832525) (← links)
- A variant of the hypergraph removal lemma (Q855826) (← links)
- Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree (Q859609) (← links)
- Integer and fractional packings of hypergraphs (Q864903) (← links)
- A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal Lemma (Q926374) (← links)
- Note on the 3-graph counting Lemma (Q941395) (← links)
- An approximate Dirac-type theorem for \(k\)-uniform hypergraphs (Q949794) (← links)
- Weak hypergraph regularity and linear hypergraphs (Q965243) (← links)
- Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs (Q987557) (← links)
- Generalizations of the removal lemma (Q987562) (← links)
- Hereditary properties of hypergraphs (Q1003850) (← links)
- On the Ramsey number of sparse 3-graphs (Q1015430) (← links)
- A combinatorial proof of the removal lemma for groups (Q1024351) (← links)
- Extremal systems with upper-bounded odd intersections (Q1359376) (← links)
- Extremal set systems with restricted \(k\)-wise intersections. (Q1427014) (← links)
- Additive combinatorics and graph theory (Q1620873) (← links)
- A removal lemma for systems of linear equations over finite fields (Q1758978) (← links)
- The number of 3-SAT functions (Q1936820) (← links)
- On optimal \(M\)-sets related to Motzkin's problem (Q1983376) (← links)
- Extremal set theory for the binomial norm (Q2010646) (← links)
- An approximate logic for measures (Q2017144) (← links)
- Hypergraphs without exponents (Q2049452) (← links)
- Hamiltonian cycles above expectation in \(r\)-graphs and quasi-random \(r\)-graphs (Q2072184) (← links)
- Hamiltonian paths and cycles in some 4-uniform hypergraphs (Q2157837) (← links)
- Extremal problems in uniformly dense hypergraphs (Q2189833) (← links)
- Sparse hypergraphs: new bounds and constructions (Q2222044) (← links)
- A tight bound for hypergraph regularity (Q2334614) (← links)
- A relative Szemerédi theorem (Q2355780) (← links)
- Density theorems and extremal hypergraph problems (Q2382340) (← links)
- Almost all triple systems with independent neighborhoods are semi-bipartite (Q2431618) (← links)
- The Gaussian primes contain arbitrarily shaped constellations (Q2479612) (← links)
- 3-uniform hypergraphs of bounded degree have linear Ramsey numbers (Q2483473) (← links)
- Short paths in quasi-random triple systems with sparse underlying graphs (Q2496208) (← links)
- Roth-type theorems in finite groups (Q2509729) (← links)
- On a Turán-type hypergraph problem of Brown, Erdős and T. Sós (Q2566157) (← links)
- <i>σ</i>-algebras for quasirandom hypergraphs (Q2951886) (← links)
- Ramsey properties of random discrete structures (Q3061178) (← links)
- On one extremal problem of Pompeiu sets (Q3076350) (← links)
- A hypergraph blow-up lemma (Q3094607) (← links)
- Weak quasi-randomness for uniform hypergraphs (Q3119042) (← links)
- The quasi-randomness of hypergraph cut properties (Q3119045) (← links)
