Wei-Tian Li

activity

20102025

most citedThe Strongly Antimagic labelings of Double Spiders

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

collaborators

14 papers

math.CO2025

Constructing the antimagic labelings for double stars union paths on three vertices

Wei-Tian Li, Po-Wen Yang

For a graph on $m$ edges, a bijective function between the edge set of the graph and ${1, 2, \dots, m}$ is an antimagic labeling provided that when adding the labels of the edges i…

math.CO2024

Every connected graph admits a local antimagic orientation and almost every graph admits an antimagic orientation

Eranda Dhananjaya, Wei-Tian Li

An undirected graph $G$ is said to admit an antimagic orientation if there exist an orientation $D$ and a bijection between $E (G)$ and ${1, 2, \dots, ∣ E (G) ∣}$ such that any two ver…

math.CO2021★ 1 cited

Ramsey Properties for $V$ -shaped Posets in the Boolean Lattices

Hong-Bin Chen, Wei-Han Chen, Yen-Jen Cheng +2

Given posets $P_{1}, P_{2}, \dots, P_{k}$ , let the {\em Boolean Ramsey number} $R (P_{1}, P_{2}, \dots, P_{k})$ be the minimum number $n$ such…

math.CO2020

The antimagic orientation problems for graphs obtained by some graph operations

Eranda Dhananjaya, Wei-Tian Li

A simple graph $G$ is said to admit an antimagic orientation if there exist an orientation on the edges of $G$ and a bijection from $E (G)$ to ${1, 2, \dots, ∣ E (G) ∣}$ such that the…

math.CO2019★ 3 cited

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 $P$ and $Q$ , we look for the smallest Boolean lattice $\…

math.CO2018★ 5 cited

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.CO2017

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 $P$ , consider a chain decomposition $C$ of $P$ . If $∣ C_{1} ∣ \leq ∣ C_{2} ∣$ implies that the set of the ranks of elements in $C_{1}$ is a subset of the ranks o…

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.CO2013

A Common Generalization of the Theorems of Erdős-Ko-Rado and Hilton-Milner

Wei-Tian Li, Bor-Liang Chen, Kuo-Ching Huang +1

Let $m$ , $n$ , and $k$ be integers satisfying $0 < k \leq n < 2 k \leq m$ . A family of sets $F$ is called an $(m, n, k)$ -intersecting family if $\binom{[n]}{k} \subseteq \mat…

math.CO2012★ 1 cited

Poset-free Families and Lubell-boundedness

Jerrold R. Griggs, Wei-Tian Li

Given a finite poset $P$ , we consider the largest size $\lanp$ of a family $\F$ of subsets of $[n] := {1, ..., n}$ that contains no subposet $P$ . This continues the study of the asym…

math.CO2012

The Asymptotic Bound of the Lubell Function for Diamond-free Families