Sperner systems containing at most k sets of every cardinality

DOI10.1016/S0012-365X(97)00067-8zbMATH Open0876.05097OpenAlexW2018978685MaRDI QIDQ1363663FDOQ1363663

Authors: L. Lipták 

Publication date: 10 August 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(97)00067-8

Recommendations

• scientific article; zbMATH DE number 4108764
• New bounds on the maximum size of Sperner partition systems
• scientific article; zbMATH DE number 3946128
• A Sperner-type theorem for set-partition systems
• k-color Sperner theorems

zbMATH Keywords

subsetsSperner system

Mathematics Subject Classification ID

Extremal set theory (05D05)

Cited In (10)

• More constructions for Sperner partition systems
• On saturated \(k\)-Sperner systems
• New bounds on the maximum size of Sperner partition systems
• A Sperner-type theorem for set-partition systems
• Title not available (Why is that?)
• Sperner partition systems
• On \(L\)-close Sperner systems
• Minimum number of subsets to distinguish individual elements
• A Ramsey-Sperner theorem
• THE MAXIMUM CARDINALITY OF A HEREDITARY KÖNIG-EGERVÁRY SET-SYSTEM

This page was built for publication: Sperner systems containing at most \(k\) sets of every cardinality

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