7 citations · 11 across the 5 of their papers we have counts for
8 papers
Ramsey Properties for -shaped Posets in the Boolean Lattices
Hong-Bin Chen, Wei-Han Chen, Yen-Jen Cheng +2
Given posets , let the {\em Boolean Ramsey number} be the minimum number such…
The Boolean Rainbow Ramsey Number of Antichains, Boolean Posets, and Chains
Hong-Bin Chen, Yen-Jen Cheng, Wei-Tian Li +1
Motivated by the paper of Axenovich and Walzer [2], we study the Ramsey-type problems on the Boolean lattices. Given posets and , we look for the smallest Boolean lattice $\…
Rainbow Ramsey problems for the Boolean lattice
Fei-Huang Chang, Dániel Gerbner, Wei-Tian Li +4
We address the following rainbow Ramsey problem: For posets what is the smallest number such that any coloring of the elements of the Boolean lattice either admits…
Shifted-antimagic Labelings for Graphs
Fei-Huang Chang, Hong-Bin Chen, Wei-Tian Li +1
The concept of antimagic labelings of a graph is to produce distinct vertex sums by labeling edges through consecutive numbers starting from one. A long-standing conjecture is that…
The Strongly Antimagic labelings of Double Spiders
Fei-Huang Chang, Pinhui Chin, Wei-Tian Li +1
A graph is strongly antimagic, if there is a bijective mapping such that for any two vertices , not only $\sum_{e \in E(u)}f(e) \ne…
Some Sufficient Conditions for Finding a Nesting of the Normalized Matching Posets of Rank 3
Yu-Lun Chang, Wei-Tian Li
Given a graded poset , consider a chain decomposition of . If implies that the set of the ranks of elements in is a subset of the ranks o…