Partition‐free families of sets

DOI10.1112/plms.12236zbMath1422.05102arXiv1706.00215OpenAlexW2915137683WikidataQ128382910 ScholiaQ128382910MaRDI QIDQ5237375

Peter Frankl, Andrey B. Kupavskii

Publication date: 17 October 2019

Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

Kleitman's conjecture

Mathematics Subject Classification ID

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

Related Items (8)

On a Frankl-Wilson theorem ⋮ New bounds on clique-chromatic numbers of Johnson graphs ⋮ On stability of the independence number of a certain distance graph ⋮ Modularity of some distance graphs ⋮ New bounds for the clique-chromatic numbers of Johnson graphs ⋮ 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

This page was built for publication: Partition‐free families of sets