On matchings in hypergraphs
From MaRDI portal
Publication:456292
zbMath1252.05092MaRDI QIDQ456292
Tomasz Łuczak, Katarzyna Mieczkowska, Peter Frankl
Publication date: 24 October 2012
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v19i2p42
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (27)
A Stability Result on Matchings in 3-Uniform Hypergraphs ⋮ Size and structure of large \((s,t)\)-union intersecting families ⋮ Degree versions of the Erdős-Ko-Rado theorem and Erdős hypergraph matching conjecture ⋮ Improved bounds for Erdős' matching conjecture ⋮ Rainbow Perfect Matchings for 4-Uniform Hypergraphs ⋮ On vertex independence number of uniform hypergraphs ⋮ Proof of the Erdős matching conjecture in a new range ⋮ Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs ⋮ A better bound on the size of rainbow matchings ⋮ Rainbow Turán numbers of matchings and forests of hyperstars in uniform hypergraphs ⋮ Intersection theorems for multisets ⋮ On Rainbow Matchings for Hypergraphs ⋮ Hypergraph Turán numbers of linear cycles ⋮ On Erdős' extremal problem on matchings in hypergraphs ⋮ On the random version of the Erdős matching conjecture ⋮ On the size of shadow-added intersecting families ⋮ Rainbow matchings in properly-colored hypergraphs ⋮ A generalization of Erdős' matching conjecture ⋮ On non-trivial families without a perfect matching ⋮ On the maximum size of subfamilies of labeled set with given matching number ⋮ Extremal \(G\)-free induced subgraphs of Kneser graphs ⋮ Linear trees in uniform hypergraphs ⋮ Rainbow matchings for 3-uniform hypergraphs ⋮ Invitation to intersection problems for finite sets ⋮ Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman ⋮ On the rainbow matching conjecture for 3-uniform hypergraphs ⋮ On the bandwidth of the Kneser graph
This page was built for publication: On matchings in hypergraphs
