Saturating Sperner families

DOI10.1007/s00373-012-1195-6zbMath1272.05212arXiv1105.4453OpenAlexW1981663372MaRDI QIDQ367051

Nathan Lemons, Balázs Patkós, Dániel Gerbner, Cory Palmer, Dömötör Pálvölgyi, Balázs Keszegh

Publication date: 26 September 2013

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

extremal set theorysaturationSperner property

Mathematics Subject Classification ID

Extremal set theory (05D05) Ramsey theory (05D10)

Related Items (14)

Almost all permutation matrices have bounded saturation functions ⋮ Improved bounds for induced poset saturation ⋮ On saturated \(k\)-Sperner systems ⋮ Saturation of Ordered Graphs ⋮ Improved bounds for cross-Sperner systems ⋮ The saturation spectrum for antichains of subsets ⋮ The induced saturation problem for posets ⋮ The domination number of the graph defined by two levels of the \(n\)-cube. II ⋮ The saturation number of induced subposets of the Boolean lattice ⋮ The domination number of the graph defined by two levels of the \(n\)-cube ⋮ Saturation Problems about Forbidden 0-1 Submatrices ⋮ Induced and non-induced poset saturation problems ⋮ The largest projective cube-free subsets of \(\mathbb{Z}_{2^n}\) ⋮ Saturation for small antichains

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On minimum saturated matrices
• The saturation function of complete partite graphs
• Maximal flat antichains of minimum weight
• More on maximal intersecting families of finite sets
• On maximal intersecting families of finite sets
• Saturated \(r\)-uniform hypergraphs
• An upper bound for the Turán number \(t_3(n,4)\)
• Extremal problems among subsets of a set
• Hypergraph regularity and the multidimensional Szemerédi theorem
• Weakly Saturated Hypergraphs and Exterior Algebra
• All minimum C5-saturated graphs
• Minimum C₅‐saturated graphs
• Saturated graphs with minimal number of edges
• Cycle-Saturated Graphs with Minimum Number of Edges
• The Minimum Size of Saturated Hypergraphs
• A Problem in Graph Theory
• The counting lemma for regular k‐uniform hypergraphs
• Applications of the regularity lemma for uniform hypergraphs
• On a Conjecture of Erdos, Hajnal and Moon
• On a lemma of Littlewood and Offord

This page was built for publication: Saturating Sperner families