Poset Ramsey number R(P, Qn). III. Chain compositions and antichains

被引:1
作者
Winter, Christian [1 ]
机构
[1] Karlsruhe Inst Technol, Karlsruhe, Germany
关键词
Poset Ramsey number; Boolean lattice; Chain decompositions; Antichains;
D O I
10.1016/j.disc.2024.114031
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
An induced subposet ( P 2 , <= 2 ) of a poset ( P 1 , <= 1 ) is a subset of P 1 such that for every two X , Y E P 2 , X <= 2 Y if and only if X <= 1 Y . The Boolean lattice Q n of dimension n is the poset consisting of all subsets of { 1 , ..., n } ordered by inclusion. Given two posets P 1 and P 2 the poset Ramsey number R ( P 1 , P 2 ) is the smallest integer N such that in any blue/red coloring of the elements of Q N there is either a monochromatically blue induced subposet isomorphic to P 1 or a monochromatically red induced subposet isomorphic to P 2 . We provide upper bounds on R ( P , Q n ) for two classes of P : parallel compositions of chains, i.e. posets consisting of disjoint chains which are pairwise element -wise incomparable, as well as subdivided Q 2 , which are posets obtained from two parallel chains by adding a common minimal and a common maximal element. This completes the determination of R ( P , Q n ) for posets P with at most 4 elements. If P is an antichain A t on t elements, we show that R ( A t , Q n ) = n + 3 for 3 <= t <= log log n . Additionally, we briefly survey proof techniques in the poset Ramsey setting P versus Q n . (c) 2024 The Author(s). Published by Elsevier B.V. This is an open access article under the CC BY license (http://creativecommons .org /licenses /by /4 .0/).
引用
收藏
页数:14
相关论文
共 23 条
[1]  
Axenovich M., 2024, Poset Ramsey number R(P,Qn). II. N-shaped poset
[2]   Poset Ramsey numbers: large Boolean lattice versus a fixed poset [J].
Axenovich, Maria ;
Winter, Christian .
COMBINATORICS PROBABILITY AND COMPUTING, 2023, 32 (04) :638-653
[3]   Boolean Lattices: Ramsey Properties and Embeddings [J].
Axenovich, Maria ;
Walzer, Stefan .
ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS, 2017, 34 (02) :287-298
[4]  
Bohman T., 2022, A construction for Boolean cube Ramsey numbers
[5]   Rainbow Ramsey Problems for the Boolean Lattice [J].
Chang, Fei-Huang ;
Gerbner, Daniel ;
Li, Wei-Tian ;
Methuku, Abhishek ;
Nagy, Daniel T. ;
Patkos, Balazs ;
Vizer, Mate .
ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS, 2022, 39 (03) :453-463
[6]  
Chen H., 2021, PREPRINT
[7]   The Boolean Rainbow Ramsey Number of Antichains, Boolean Posets and Chains [J].
Chen, Hong-Bin ;
Cheng, Yen-Jen ;
Li, Wei-Tian ;
Liu, Chia-An .
ELECTRONIC JOURNAL OF COMBINATORICS, 2020, 27 (04) :1-12
[8]   Ramsey Numbers for Partially-Ordered Sets [J].
Cox, Christopher ;
Stolee, Derrick .
ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS, 2018, 35 (03) :557-579
[9]  
de Bruijn N.G., 1951, NIEUW ARCH WISKUNDE, V2, P191
[10]  
Diestel Reinhard., 2005, Graph theory, V173, DOI [10.1007/978-3-662-53622-3, DOI 10.1007/978-3-662-53622-3]