Multicolor chain avoidance in the Boolean lattice

DOI10.1016/J.EJC.2020.103135MaRDI QIDQ2178677zbMATH OpenOpenAlexFDO

Authors Hunter Spink, Marius Tiba

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

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)

Abstract: Given a collection of colored chain posets, we estimate the number of colored subsets of the boolean lattice which avoid all chains in the collection.

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

Cites work

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

Cited in

(1)

• On colorings of the Boolean lattice avoiding a rainbow copy of a poset

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)