Families with no matchings of size \(s\)

DOI10.1016/J.ENDM.2017.06.077zbMath1378.05201OpenAlexW2744053296MaRDI QIDQ1689961

Peter Frankl, Andrey B. Kupavskii

Publication date: 18 January 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2017.06.077

zbMATH Keywords

matchingsErdős matching conjectureset familiesforbidden subconfigurations

Mathematics Subject Classification ID

Extremal set theory (05D05) Transversal (matching) theory (05D15)

Related Items (4)

The Erdős matching conjecture and concentration inequalities ⋮ Random Kneser graphs and hypergraphs ⋮ On families of sets without \(k\) pairwise disjoint members ⋮ Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman

Cites Work

• Unnamed Item
• Improved bounds for Erdős' matching conjecture
• Anti-Ramsey number of matchings in hypergraphs
• On the maximum number of edges in a hypergraph with given matching number
• On Erdős' extremal problem on matchings in hypergraphs
• On maximal paths and circuits of graphs
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
• Families with no s pairwise disjoint sets
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Maximal number of subsets of a finite set No k of which are pairwise disjoint

This page was built for publication: Families with no matchings of size \(s\)