Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.21868

Rich-neighbor 5-edge-colorings of subcubic graphs whose 3-vertices induce a matching

Jiangxu Kong·Zhuming Lin·Yan Wang
View original source ↗Read source document ↗Export metadata ↓

Abstract

Let $φ$ be a proper edge-coloring of a graph $G$. An edge is called rich if all edges adjacent to it receive pairwise distinct colors. The coloring $φ$ is a rich-neighbor edge-coloring if every non-isolated edge is adjacent to a rich edge. Petruševski and Škrekovski introduced this notion as a relaxation of strong edge-coloring and conjectured that every connected subcubic graph other than $K_4$ admits a rich-neighbor $5$-edge-coloring. We establish the conjectured bound for every subcubic graph $G$ satisfying $Δ(G[V_3])\leq 1,$ where $V_3$ is the set of vertices of degree $3$ in $G$. Equivalently, the $3$-vertices of $G$ induce a matching together with isolated vertices. This extends the result of Chen, Tan and Zhou for subcubic graphs with no adjacent $3$-vertices.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jiangxu Kong, Zhuming Lin, Yan Wang. 2026-10-15. Rich-neighbor 5-edge-colorings of subcubic graphs whose 3-vertices induce a matching. https://arxiv.org/abs/2610.21868

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

KEEP EXPLORING

Related papers

arXiv2026

The $q$-deformed random-to-random family in the Hecke algebra

We generalize Reiner--Saliola--Welker's well-known but mysterious family of *$k$-random-to-random shuffles* from Markov chains on symmetric groups to Markov chains on Type-$A$ Iwahori--Hecke algebras. We prove that these operators pairwise commute, and that their eigenvalues are polynomials in $q$ with non-negative integer coefficients; we express these eigenvalues in a closed form as certain symmetric function evaluations (which is new even for $q=1$). We show that these operators are simultaneously diagonalizable for almost all $q$, and combinatorially express the dimension of the subalgebra they generate. Our work generalizes and extends work of Reiner--Saliola--Welker and Lafrenière for the symmetric group, and simplifies all known proofs in this case.

math.CO↗
arXiv2026

An upper bound for the list-distinguishing chromatic number of $K_{r,r+1}$-free graphs

In 2006, Collins and Trenk obtained a general sharp upper bound for the distinguishing chromatic number of a connected graph. Inspired by Catlin's combinatorial techniques from 1978, we establish improved upper bounds for classes of connected graphs that have only small complete bigraphs as induced subgraphs. In this framework, we also consider the list-distinguishing chromatic number of such graphs. We apply Menger's theorem to demonstrate applications of our main result for graphs whose constructions are based on Paley graphs and Cayley graphs on Dihedral groups.

math.CO↗
arXiv2026

Magic Gems: Convex Hulls of Lifted Magic Squares

Given an arrangement of $\{1,\dots,n^2\}$ in an $n\times n$ grid, we lift each cell to $\mathbb{R}^3$ by centring its grid coordinates $(x,y)$ at the origin and taking its centred entry $z = s_{ij} - (n^2+1)/2$ as a vertical height. The convex hull of these $n^2$ points is the gem of the arrangement, whose lower and upper boundaries are the regular subdivisions of the grid induced by $\pm z$. While random arrangements and generic linear magic squares have gems whose vertex counts grow with $n$, our main theorem shows that the classical Siamese (de la Loubère) magic square of every odd order $n\ge5$ has $f$-vector $(12,26,16)$, isometry group $\{\pm\mathrm{id}\}$, and only the twelve vertices forced by the boundary of the grid. The proof shears the lift onto five horizontal terraces and reduces the hull calculation to a finite table of polynomials in $m=(n-1)/2$; the same method gives $f$-vector $(12,24,14)$ for the base-$n$ digit-exchanged square. Along any family of linear squares with fixed steps the $f$-vector is eventually periodic in $n$, whereas over all linear magic squares of prime order $n$ the maximum vertex count grows as $Θ(\ln n)$. Whenever the heights have vanishing first moments, a short principal-axes argument shows that the point set has a non-trivial isometry if and only if the arrangement is self-complementary up to dihedral symmetry. An exact census of the $880$ magic squares of order four yields $616$ congruence classes and $352$ combinatorial types of gems, and shows that while vertex and facet counts are nearly insensitive to the magic line-sum conditions, the volume and solid centroid shift systematically.

math.CO↗