\(l\)-trace \(k\)-Sperner families of sets

DOI10.1016/j.jcta.2009.02.003zbMath1194.05153OpenAlexW2024656784MaRDI QIDQ1024991

Balázs Patkós

Publication date: 18 June 2009

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

Full work available at URL: https://doi.org/10.1016/j.jcta.2009.02.003

zbMATH Keywords

families of setsSperner propertytrace of sets

Mathematics Subject Classification ID

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

Related Items (2)

Forbidden subposet problems for traces of set families ⋮ On \(L\)-close Sperner systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Defect Sauer results
• Unavoidable traces of set systems
• No four subsets forming an \(N\)
• On the density of families of sets
• Disjoint representability of sets and their complements
• Logarithmic order of free distributive lattice
• Reverse Kleitman Inequalities
• A short proof of Sperner's lemma
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• Generalization of Sperner’s Theorem on the Number of Subsets of a Finite Set

This page was built for publication: \(l\)-trace \(k\)-Sperner families of sets