3 citations · 5 across the 8 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…
Beyond Hamiltonicity of Prime Difference Graphs
Hong-Bin Chen, Hung-Lin Fu, Jun-Yi Guo
A graph is Hamiltonian if it contains a cycle which visits every vertex of the graph exactly once. In this paper, we consider the problem of Hamiltonicity of a graph , which w…
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 $\…
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…
From a Consequence of Bertrand's Postulate to Hamilton Cycles
Hong-Bin Chen, Hung-Lin Fu, Jun-Yi Guo
A consequence of Bertrand's postulate, proved by L. Greenfield and S. Greenfield in 1998, assures that the set of integers can be partitioned into pairs so tha…
Families of Subsets Without a Given Poset in the Interval Chains
Jun-Yi Guo, Fei-Huang Chang, Hong-Bin Chen +1
For two posets and , we say is -free if there does not exist any order-preserving injection from to . The speical case for being the Boolean lattice …
On-Line Choice Number of Complete Multipartite Graphs: an Algorithmic Approach
Fei-Huang Chang, Hong-Bin Chen, Jun-Yi Guo +1
This paper studies the on-line choice number on complete multipartite graphs with independence number . We give a unified strategy for every prescribed . Our main result lead…
Multi-Group Testing for Items with Real-Valued Status under Standard Arithmetic
Fei-Huang Chang, Hong-Bin Chen, Jun-Yi Guo +1
This paper proposes a novel generalization of group testing, called multi-group testing, which relaxes the notion of "testing subset" in group testing to "testing multi-set". The g…