Multicolor chain avoidance in the Boolean lattice
DOI10.1016/J.EJC.2020.103135zbMATH Open1439.05109arXiv1904.04080OpenAlexW3017703211MaRDI QIDQ2178677FDOQ2178677
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
Recommendations
- On colorings of the Boolean lattice avoiding a rainbow copy of a poset
- Avoiding monochromatic configurations in the multi-colored plane
- scientific article; zbMATH DE number 3557853
- Coloring of lattices
- Coloring Ordered Sets to Avoid Monochromatic Maximal Chains
- Avoiding monotone chains in fillings of layer polyominoes
- Maximal Chains and Antichains in Boolean Lattices
- Generalized colorings and avoidable orientations
- On the Optimality of Coloring with a Lattice
- Pattern avoidance in coloured permutations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15) Enumeration in graph theory (05C30) Hypergraphs (05C65) Combinatorics of partially ordered sets (06A07) Lattices (06B99)
Cites Work
- Hypergraph containers
- Independent sets in hypergraphs
- On Dedekind's Problem: The Number of Monotone Boolean Functions
- Maximum-size antichains in random set-systems
- A random version of Sperner's theorem
- Sperner's Theorem and a Problem of Erdős, Katona and Kleitman
- Applications of graph containers in the Boolean lattice
- THE METHOD OF HYPERGRAPH CONTAINERS
- Multicolor containers, extremal entropy, and counting
Cited In (1)
This page was built for publication: Multicolor chain avoidance in the Boolean lattice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2178677)
