Kecai Deng

collaborators

2 papers

math.CO2026

Regular graphs are universally 3-edge-weightable

Kecai Deng

A graph is universally $k$ -edge-weightable if for every $k$ -element set $Q \subset R$ , it admits a proper $Q$ -edge weighting. The settled 1-2-3 conjecture implies that for a…

math.CO2025

Every graph is uniform-span $(2, 2)$ -choosable: Beyond the 1-2 conjecture

Kecai Deng, Hongyuan Qiu

For a simple graph $G = (V, E)$ , a \emph{proper total weighting} is a mapping $w : V \cup E \to R$ such that for every edge $uv \in E$ , $w(u)+\sum_{e\ni u}w(e)\neq w(v)+\s…

Regular graphs are universally 3-edge-weightable

Every graph is uniform-span (2,2)-choosable: Beyond the 1-2 conjecture

Every graph is uniform-span $(2, 2)$ -choosable: Beyond the 1-2 conjecture