On the arithmetic mean of the size of cross-union families

DOI10.1007/s10474-021-01138-6zbMath1488.05478OpenAlexW3159734514MaRDI QIDQ2043692

Peter Frankl

Publication date: 3 August 2021

Published in: Acta Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10474-021-01138-6

zbMATH Keywords

intersectioncyclic permutationfinite set

Mathematics Subject Classification ID

Extremal set theory (05D05) Structural characterization of families of graphs (05C75)

Related Items

A proof of Frankl's conjecture on cross-union families

Cites Work

• Unnamed Item
• Unnamed Item
• Improved bounds for Erdős' matching conjecture
• A new short proof of the EKR theorem
• The complete intersection theorem for systems of finite sets
• Erdős-Ko-Rado theorem with conditions on the maximal degree
• On Sperner families satisfying an additional condition
• Regular bipartite graphs and intersecting families
• New injective proofs of the Erdős-Ko-Rado and Hilton-Milner theorems
• Erdős-Ko-Rado from Kruskal-Katona
• Old and new applications of Katona's circle
• A simple proof of the Erdős-Chao Ko-Rado theorem
• On r-Cross Intersecting Families of Sets
• Extremal Finite Set Theory
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• On the Shannon capacity of a graph
• A Short Proof for an Extension of the Erdős–Ko–Rado Theorem
• Intersection theorems for systems of finite sets
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Maximal number of subsets of a finite set No k of which are pairwise disjoint
• On intersecting families of finite sets
• A new generalization of the Erdős-Ko-Rado theorem