Minimum degree and diversity in intersecting antichains

DOI10.1007/s10474-020-01100-yzbMath1474.05378OpenAlexW3108054139MaRDI QIDQ2036583

Peter Frankl

Publication date: 29 June 2021

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

Full work available at URL: https://doi.org/10.1007/s10474-020-01100-y

zbMATH Keywords

antichainminimum degreeextremal problemfinite set\(t\)-intersecting

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Extremal set theory (05D05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maximum degree and diversity in intersecting hypergraphs
• Shadows and shifting
• Two extremal problems on intersecting families
• Diversity of uniform intersecting families
• Regular bipartite graphs and intersecting families
• Degree versions of theorems on intersecting families via stability
• Degree versions of the Erdős-Ko-Rado theorem and Erdős hypergraph matching conjecture
• Antichains of fixed diameter
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Generalizations of theorems of Katona and Milner
• Intersection theorems for systems of finite sets
• A Combinatorial Theorem on Systems of Sets
• Diversity

This page was built for publication: Minimum degree and diversity in intersecting antichains