Families of sets with no matchings of sizes 3 and 4

DOI10.1016/j.ejc.2018.08.005zbMath1400.05252arXiv1701.04107OpenAlexW2962874402MaRDI QIDQ1621069

Peter Frankl, Andrey B. Kupavskii

Publication date: 15 November 2018

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1701.04107

zbMATH Keywords

Intersection theorems for systems of finite setsmatchings in set families

Mathematics Subject Classification ID

Extremal set theory (05D05)

Related Items (13)

The Erdős matching conjecture and concentration inequalities ⋮ On families with bounded matching number ⋮ New bounds on clique-chromatic numbers of Johnson graphs ⋮ On the random version of the Erdős matching conjecture ⋮ Modularity of some distance graphs ⋮ New bounds for the clique-chromatic numbers of Johnson graphs ⋮ Refuting conjectures in extremal combinatorics via linear programming ⋮ Extremal set theory for the binomial norm ⋮ Old and new applications of Katona's circle ⋮ Lower bounds on the clique-chromatic numbers of some distance graphs ⋮ On the independence numbers of distance graphs with vertices in \(\{-1, 0, 1\}^n\) ⋮ Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman ⋮ On the independence numbers of some distance graphs with vertices in \(\{-1, 0, 1\}^n\)

Cites Work

• New inequalities for families without \(k\) pairwise disjoint members
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Intersection theorems for systems of finite sets
• Families with no s pairwise disjoint sets
• Maximal number of subsets of a finite set No k of which are pairwise disjoint

This page was built for publication: Families of sets with no matchings of sizes 3 and 4