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.05053MaRDI 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
05C35: Extremal problems in graph theory
05C65: Hypergraphs
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05B07: Triple systems
Related Items
A Stability Result on Matchings in 3-Uniform Hypergraphs, Rainbow version of the Erdős Matching Conjecture via concentration, Rainbow Turán numbers of matchings and forests of hyperstars in uniform hypergraphs, Regular subgraphs of uniform hypergraphs, Improved bounds for Erdős' matching conjecture, Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels, On the maximum number of edges in a hypergraph with given matching number, The minimum number of disjoint pairs in set systems and related problems, Rainbow matchings in properly-colored hypergraphs, Turán problems for vertex-disjoint cliques in multi-partite hypergraphs, A short proof of Erdős' conjecture for triple systems, The size of 3-uniform hypergraphs with given matching number and codegree, A generalization of Erdős' matching conjecture, The Erdős matching conjecture and concentration inequalities, On the maximum size of subfamilies of labeled set with given matching number, On the bandwidth of the Kneser graph, Degree versions of the Erdős-Ko-Rado theorem and Erdős hypergraph matching conjecture, Hypergraph Turán numbers of linear cycles, On Erdős' extremal problem on matchings in hypergraphs, Linear trees in uniform hypergraphs, The \((p, q)\)-extremal problem and the fractional chromatic number of Kneser hypergraphs
Cites Work
