Rainbow Ramsey problems for the Boolean lattice

DOI10.1007/s11083-021-09581-4OpenAlexW4205404130MaRDI QIDQ2088071

Fei-Huang Chang, Dániel T. Nagy, Máté Vizer, Balázs Patkós, Dániel Gerbner, Wei-Tian Li, Abhishek Methuku

Publication date: 21 October 2022

Published in: Order (Search for Journal in Brave)

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

zbMATH Keywords

Ramsey theoryextremal set systemsforbidden subposet problem

Mathematics Subject Classification ID

Order, lattices, ordered algebraic structures (06-XX)

Related Items (2)

Poset Ramsey numbers: large Boolean lattice versus a fixed poset ⋮ Ramsey numbers of Boolean lattices

Cites Work

• Unnamed Item
• Boolean algebras and Lubell functions
• Diamond-free families
• A Ramsey theoretic problem for finite ordered sets
• A LYM inequality for induced posets
• An upper bound on the size of diamond-free families of sets
• Ramsey numbers for partially-ordered sets
• The partition method for poset-free families
• The Boolean rainbow Ramsey number of antichains, Boolean posets and chains
• Induced and non-induced forbidden subposet problems
• Poset-free families and Lubell-boundedness
• Boolean lattices: Ramsey properties and embeddings
• On Families of Subsets With a Forbidden Subposet

This page was built for publication: Rainbow Ramsey problems for the Boolean lattice