Counting Intersecting and Pairs of Cross-Intersecting Families

DOI10.1017/S0963548317000529zbMath1378.05202arXiv1701.04110OpenAlexW2963830531MaRDI QIDQ4601052

Peter Frankl, Andrey B. Kupavskii

Publication date: 19 January 2018

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

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

zbMATH Keywords

intersecting families of subsets

Mathematics Subject Classification ID

Extremal set theory (05D05)

Related Items (12)

On the structure of large sum-free sets of integers ⋮ Diversity of uniform intersecting families ⋮ Structure and supersaturation for intersecting families ⋮ Regular bipartite graphs and intersecting families ⋮ A generalization of Kneser graphs ⋮ Intersecting families of sets are typically trivial ⋮ On hypergraphs without loose cycles ⋮ Diversity ⋮ On the chromatic numbers of small-dimensional Euclidean spaces ⋮ A generalization of the Bollobás set pairs inequality ⋮ On the independence numbers of some distance graphs with vertices in \(\{-1, 0, 1\}^n\) ⋮ Degree versions of theorems on intersecting families via stability

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Erdős-Ko-Rado theorem with conditions on the maximal degree
• Some best possible inequalities concerning cross-intersecting families
• Solution of a problem of A. Ehrenfeucht and J. Mycielski
• Intersecting families of discrete structures are typically trivial
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• On generalized graphs
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS

This page was built for publication: Counting Intersecting and Pairs of Cross-Intersecting Families