Families with no s pairwise disjoint sets
From MaRDI portal
Publication:5357256
DOI10.1112/jlms.12041zbMath1370.05214arXiv1607.06122OpenAlexW3125228091MaRDI QIDQ5357256
Peter Frankl, Andrey B. Kupavskii
Publication date: 14 September 2017
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1607.06122
Related Items (13)
Families of sets with no matchings of sizes 3 and 4 ⋮ Sharp bounds for the chromatic number of random Kneser graphs ⋮ The Erdős matching conjecture and concentration inequalities ⋮ Structure and supersaturation for intersecting families ⋮ On families with bounded matching number ⋮ Families with no matchings of size \(s\) ⋮ Stability for vertex isoperimetry in the cube ⋮ Random Kneser graphs and hypergraphs ⋮ On families of sets without \(k\) pairwise disjoint members ⋮ Refuting conjectures in extremal combinatorics via linear programming ⋮ Extremal set theory for the binomial norm ⋮ Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman ⋮ Degree versions of theorems on intersecting families via stability
This page was built for publication: Families with no s pairwise disjoint sets
