Maximal antichains of minimum size

zbMath1267.05281arXiv1206.3007MaRDI QIDQ1953477

Ian T. Roberts, Thomas Kalinowski, Uwe Leck

Publication date: 7 June 2013

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

extremal set theorySperner propertymaximal antichainsflat antichains

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorics of partially ordered sets (06A07) Extremal set theory (05D05)

Related Items (2)

Minimum weight flat antichains of subsets ⋮ The saturation spectrum for antichains of subsets

Cites Work

• Unnamed Item
• Unnamed Item
• A new proof of the graph removal lemma
• Maximal flat antichains of minimum weight
• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
• Antichains on three levels
• Antichains and completely separating systems -- a catalogue and applications
• Flattening antichains
• Minimum weight flat antichains of subsets
• On the Minimal Density of Triangles in Graphs
• Lower bounds on the number of triangles in a graph
• Extremal problems in finite sets

This page was built for publication: Maximal antichains of minimum size