Multicolour chain avoidance in the boolean lattice

2019/04/08 by Hunter Spink, Spink, Hunter, Marius Tiba +1
Computer Science · Mathematics · #05C15 #05C65 #05C69 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Limits and Structures in Graph Theory

paper · pdf · doi:10.48550/arxiv.1904.04080

openalex publication_date 2019/04/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Citations

• Multicolour containers and the entropy of decorated graph limits

Related

• The Boolean Rainbow Ramsey Number of Antichains, Boolean Posets, and Chains
• On colorings of the Boolean lattice avoiding a rainbow copy of a poset
• Chain Posets
• Ramsey Properties for V-shaped Posets in the Boolean Lattices
• Retracts of Posets: The Chain_gap Property and the Selection Property are Independant