Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2506.14253

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

Kecai Deng·Hongyuan Qiu
View original source ↗Read source document ↗Export metadata ↓

Abstract

For a simple graph $G=(V,E)$, a \emph{proper total weighting} is a mapping $w: V\cup E\rightarrow \mathbb R$ such that for every edge $uv\in E$, $w(u)+\sum_{e\ni u}w(e)\neq w(v)+\sum_{e\ni v}w(e)$. The graph $G$ is said $(2,2)$-\emph{choosable} if, for any list assignment $L$ that assigns to each $z$ in $V\cup E$ a set $L(z)$ of two real numbers, there exists a {proper total weighting} $w$ with $w(z)\in L(z)$ for every $z\in V\cup E$. Wong and Zhu, and independently Przybyło and Woźniak conjectured that every simple graph is $(2,2)$-choosable. This conjecture remains open. For a set $\{a,b\}\subset \mathbb R$, its span is defined as $|b-a|$. We call a graph $G=(V,E)$ \emph{uniform-span} $(2,2)$-\emph{choosable} if, for any list assignment $L$ that assigns to every $z\in V\cup E$ a two-element list of a common span, there exists a {proper total weighting} respect to the assignment. In this paper, we present a novel lemma and perform comprehensive enhancements to our previous algorithm. These contributions enable us to prove that every graph is uniform-span $(2,2)$-choosable. This confirms the 1-2 conjecture in full generality, and provides supporting evidence for the $(2,2)$-choosable conjecture.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kecai Deng, Hongyuan Qiu. 2025-10-27. Every graph is uniform-span $(2,2)$-choosable: Beyond the 1-2 conjecture. https://arxiv.org/abs/2506.14253

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗