Fei-Huang Chang

activity

20152018

most citedThe Strongly Antimagic labelings of Double Spiders

7 citations · 7 across the 2 of their papers we have counts for

collaborators

5 papers

math.CO2018

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 $P, Q$ what is the smallest number $n$ such that any coloring of the elements of the Boolean lattice $B_{n}$ either admits…

math.CO2018

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…

math.CO2017★ 7 cited

The Strongly Antimagic labelings of Double Spiders

Fei-Huang Chang, Pinhui Chin, Wei-Tian Li +1

A graph $G = (V, E)$ is strongly antimagic, if there is a bijective mapping $f : E \to {1, 2, \dots, ∣ E ∣}$ such that for any two vertices $u \neq = v$ , not only $\sum_{e \in E(u)}f(e) \ne…

math.CO2016

Families of Subsets Without a Given Poset in the Interval Chains

Jun-Yi Guo, Fei-Huang Chang, Hong-Bin Chen +1

For two posets $P$ and $Q$ , we say $Q$ is $P$ -free if there does not exist any order-preserving injection from $P$ to $Q$ . The speical case for $Q$ being the Boolean lattice $B_{n}$ …

math.CO2015

Anti-magic labeling of regular graphs

Feihuang Chang, Yu-Chang Liang, Zhishi Pan +1

A graph $G = (V, E)$ is antimagic if there is a one-to-one correspondence $f : E \to {1, 2, \dots, ∣ E ∣}$ such that for any two vertices $u, v$ , $\sum_{e \in E(u)}f(e) \ne \sum_{e\in E(…