A Meshalkin theorem for projective geometries

2003/05/01 by Matthias Beck, Thomas Zasĺavsky, Thomas Zaslavsky · 1 citation
Computer Science · Engineering · Mathematics · #Advanced Graph Theory Research #Algebra over a field #Computer science #Limits and Structures in Graph Theory #Mathematics #Projective test #Pure mathematics #graph theory and CDMA systems

paper · doi:10.1016/s0097-3165(03)00049-9

crossref issued 2003/05/01 · crossref published 2003/05/01 · crossref published-print 2003/05/01 · openalex publication_date 2003/05/01 · crossref created 2003/05/27 · crossref deposited 2019/03/21 · crossref indexed 2022/04/02 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/23

Citations

• A Shorter, Simpler, Stronger Proof of the Meshalkin–Hochberg–Hirsch Bounds on Componentwise Antichains
• On a lemma of Littlewood and Offord
• Generalization of Sperner’s Theorem on the Number of Subsets of a Finite Set
• On generalized graphs
• A short proof of Sperner's lemma
• Logarithmic order of free distributive lattice
• Ein Satz �ber Untermengen einer endlichen Menge

Cited by

• Sperner's theorem [wikipedia]