A simple proof of a theorem of Milner

DOI10.1006/JCTA.1997.2848MaRDI QIDQ1268609zbMATH OpenOpenAlexFDO

Authors Gyula O. H. Katona

Publication date 14 January 1999

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL http://real.mtak.hu/21082/1/paper_86.pdf

zbMATH Keywords

cyclic permutation methodintersecting Sperner family

Mathematics Subject Classification ID

Extremal set theory (05D05)

Review text

This paper presents a simple proof, based on Katona's own cyclic permutation method, of Milner's well-known result that an intersecting Sperner family on an \(n\)-element set has at most \(\binom{n} {\lceil (n+1)/2\rceil}\) members.

Recommendations

• Another simple proof of a theorem of Milner
• Non-trivial intersecting families
• A simple proof of the Hilton-Milner theorem
• A Katona-type proof of an Erdős-Ko-Rado-type theorem

Cites work

• A Combinatorial Theorem on Systems of Sets
• A simple proof of the Erdős-Chao Ko-Rado theorem
• Intersection theorems for systems of finite sets

Cited in

(8)

• Another simple proof of a theorem of Milner
• On the average size of sets in intersecting Sperner families
• Intersecting P-free families
• A simple proof of the Hilton-Milner theorem
• A Simple Construction to Prove Mycielski’s Theorem
• scientific article; zbMATH DE number 6494969 (Why is no real title available?)
• scientific article; zbMATH DE number 4135067 (Why is no real title available?)
• scientific article; zbMATH DE number 943895 (Why is no real title available?)

This page was built for publication: A simple proof of a theorem of Milner

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1268609)