On the Maximum Number of Edges in a Triple System Not Containing a Disjoint Family of a Given Size
From MaRDI portal
Publication:2883857
DOI10.1017/S0963548311000496zbMath1241.05053OpenAlexW2031135338MaRDI QIDQ2883857
Vojtěch Rödl, Andrzej Ruciński, Peter Frankl
Publication date: 14 May 2012
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548311000496
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Triple systems (05B07)
Related Items
Regular subgraphs of uniform hypergraphs, Rainbow version of the Erdős Matching Conjecture via concentration, A Stability Result on Matchings in 3-Uniform Hypergraphs, The \((p, q)\)-extremal problem and the fractional chromatic number of Kneser hypergraphs, Degree versions of the Erdős-Ko-Rado theorem and Erdős hypergraph matching conjecture, The Erdős matching conjecture and concentration inequalities, Improved bounds for Erdős' matching conjecture, Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs, On families with bounded matching number, Large Yk,b ${Y}_{k,b}$‐tilings and Hamilton ℓ $\ell $‐cycles in k $k$‐uniform hypergraphs, Rainbow Turán numbers of matchings and forests of hyperstars in uniform hypergraphs, Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels, A short proof of Erdős' conjecture for triple systems, Hypergraph Turán numbers of linear cycles, On Erdős' extremal problem on matchings in hypergraphs, The size of 3-uniform hypergraphs with given matching number and codegree, Rainbow matchings in properly-colored hypergraphs, On the maximum number of edges in a hypergraph with given matching number, A generalization of Erdős' matching conjecture, The minimum number of disjoint pairs in set systems and related problems, On the maximum size of subfamilies of labeled set with given matching number, Linear trees in uniform hypergraphs, Turán problems for vertex-disjoint cliques in multi-partite hypergraphs, On the bandwidth of the Kneser graph
Cites Work
