Sperner's Problem forG-Independent Families

DOI10.1017/S0963548314000558zbMath1371.05296arXiv1302.6039OpenAlexW1973067850MaRDI QIDQ5364241

Victor Falgas-Ravry

Publication date: 4 October 2017

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

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

Mathematics Subject Classification ID

Extremal set theory (05D05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A decomposition theorem for partially ordered sets
• Logarithmic order of free distributive lattice
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• INTERSECTING FAMILIES OF SEPARATED SETS
• Skewincidence
• On generalized graphs
• A short proof of Sperner's lemma
• Generalization of Sperner’s Theorem on the Number of Subsets of a Finite Set
• Distinct representatives of subsets

This page was built for publication: Sperner's Problem forG-Independent Families