Multicolor chain avoidance in the Boolean lattice

DOI10.1016/j.ejc.2020.103135zbMath1439.05109arXiv1904.04080OpenAlexW3017703211MaRDI QIDQ2178677

Marius Tiba, Hunter Spink

Publication date: 11 May 2020

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

hypergraph containercolored chain posets

Mathematics Subject Classification ID

Hypergraphs (05C65) Combinatorics of partially ordered sets (06A07) Enumeration in graph theory (05C30) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Lattices (06B99)

Cites Work

• A random version of Sperner's theorem
• Hypergraph containers
• Maximum-size antichains in random set-systems
• Applications of graph containers in the Boolean lattice
• THE METHOD OF HYPERGRAPH CONTAINERS
• Multicolor containers, extremal entropy, and counting
• Independent sets in hypergraphs
• Sperner's Theorem and a Problem of Erdős, Katona and Kleitman
• On Dedekind's Problem: The Number of Monotone Boolean Functions

This page was built for publication: Multicolor chain avoidance in the Boolean lattice