294 citations
- National Tsing Hua UniversityTW44 papers
- National Taipei UniversityTW26 papers
- National Center for Theoretical SciencesTW24 papers
- Institute of Astronomy and Astrophysics, Academia SinicaTW23 papers
- National Cheng Kung UniversityTW20 papers
- National Taiwan UniversityTW18 papers
- National Astronomical Observatory of JapanJP17 papers
- National Center for Theoretical Sciences, Physics Division16 papers
- Australian National UniversityAU15 papers
- University College LondonGB15 papers
- The University of TokyoJP14 papers
- Korea Astronomy and Space Science InstituteKR13 papers
7 papers · 1 filter
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…
An Easy-to-implement Construction for -threshold Progressive Visual Secret Sharing Schemes
Hong-Bin Chen, Hsiang-Chun Hsu, Justie Su-Tzu Juan
Visual cryptography encrypts the secret image into shares (transparency) so that only stacking a qualified number of shares can recover the secret image by the human visual sys…
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…
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 …