Searcharxiv⌕ Search

arXiv subjects

Zhijun Lu

Publications and source records attributed to Zhijun Lu.

3 recordsLinked to original sources

The Proof of the Alon--Kim Conjecture

In 1997, Alon and Kim proposed an asymptotic edge-coloring bound motivated by a bound on the number of edges in intersecting uniform hypergraphs. The Alon--Kim conjecture asserts that, for fixed integers $k\ge t\ge1$ and $\varepsilon>0$, every $k$-uniform multihypergraph $H$ in which any two distinct edges intersect in at most $t$ vertices satisfies $χ'(H)\le(t-1+\frac{1}{t}+\varepsilon)Δ(H)$ whenever $Δ(H)$ is sufficiently large. In this paper, we prove the Alon--Kim conjecture. Our method combines finite-dimensional convex optimization with probabilistic methods.

math.CO↗

$(2,\mathcal{F})$-Avoiding Coloring and B-Coloring under Bipartite Exclusions

Let $\mathcal{F}$ be a nonempty family of connected bipartite graphs, each with at least two edges. For a graph $G$, a proper vertex coloring of $G$ is $(2,\mathcal{F})$-avoiding if no member of $\mathcal{F}$ occurs bichromatically, and $χ_{2,\mathcal{F}}(G)$ denotes the minimum number of colors in such a coloring. A B-coloring of $G$ is a proper edge-coloring in which every $4$-cycle is rainbow, and $q_B(G)$ denotes the minimum number of colors in a B-coloring of $G$. For a fixed connected bipartite graph $F$ with at least one edge and bipartition classes $X_F$ and $Y_F$, define $k(F)=\min\{|I|:I\subseteq X_F\text{ or }I\subseteq Y_F,F-I\text{ is a forest}\}$. Let $m\ge2$ be the minimum number of edges in a member of $\mathcal{F}$. We prove that if $k(F)\le m-2$, then every $F$-free graph $G$ of sufficiently large maximum degree $Δ$ satisfies $χ_{2,\mathcal{F}}(G)=O((\frac{Δ^m}{\logΔ})^{\frac{1}{m-1}})$, which gives a positive answer to Chuet's Problem A and C in a sharp sense, thereby extending the results of Chuet [arXiv:2603.23379] from frugal colorings to $(2,\mathcal{F})$-avoiding colorings. For B-colorings, put $k=k(F)$, $h=|V(F)|$, and $s=\min\{|X_F|,|Y_F|\}$. We prove that every $F$-free graph $G$ of sufficiently large maximum degree $Δ$ satisfies \[ q_B(G)\le \begin{cases} Δ+Δ^{1-η}+1, & \text{if }s\le2,\\ (4h-2)(Δ-1)+1, & \text{if }s\ge3\text{ and }k\le1,\\ C\frac{Δ^{2-\frac{1}{k}}}{\logΔ}, & \text{if }k\ge2, \end{cases} \] where $η>0$ and $C>0$ depend only on $F$. For $k\le1$, the linear order is best possible, and for $k\ge2$, the bound is nearly sharp. To prove these results, we develop a common reduction of the coloring problems to $P$-perfect matching problems in auxiliary hypergraphs and apply the forbidden-submatching theorem of Delcourt and Postle.

math.CO↗

Proper Conflict-Free Choosability for Graphs with Bounded Average Degree

For a graph $G$, a proper coloring of $G$ is called proper conflict-free if for every non-isolated vertex $u$, there is at least one color appearing exactly once in $N_G(u)$. A graph $G$ is proper conflict-free $f$-choosable if for every list assignment $L$ with $|L(v)|\ge f(v)$ for each vertex $v$, $G$ admits a proper conflict-free $L$-coloring. Recently, Kashima, Škrekovski, and Xu proposed a conjecture on proper conflict-free list coloring. For a graph $G$, let $κ_G:V(G)\to \mathbb{N}$ be defined by \[ κ_G(v)= \begin{cases} 4, & \text{if } d_G(v)=2,\\[4pt] d_G(v)+1, & \text{if } d_G(v)\neq 2. \end{cases} \] They conjectured that every connected graph other than $C_5$ is proper conflict-free $κ_G$-choosable. In this paper, we confirm this conjecture in two classes of graphs with bounded average degree, thereby generalizing results of Kashima, Škrekovski, and Xu and of Wang and Zhang. We prove that every connected graph $G\neq C_5$ with either $\operatorname{mad}(G)<\frac{12}{5}$ or $Δ(G)\le3$ is proper conflict-free $κ_G$-choosable. To prove these results, we introduce a method based on systems of proper conflict-free representatives and develop a construction of auxiliary graphs that preserves the maximum average degree bound.

math.CO↗