Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2601.17827

On asymptotically tight bounds for the open conflict-free chromatic indexes of nearly regular graphs

Mateusz Kamyczura·Jakub Przybyło
View original source ↗Read source document ↗Export metadata ↓

Abstract

An edge colouring $c$ of a graph $G$ is called conflic-free if every non-isolated edge of $G$ has a uniquely coloured neighbour in its open edge neighbourhood. The least number of colours admitting such a colouring is denoted by $χ'_{\rm OCF}(G)$, or $χ'_{\rm pOCF}(G)$ if we additionally require $c$ to be proper. Our main result implies in particular that $χ'_{\rm OCF}(G) \le \log_2 Δ+ O(\ln\lnΔ)$ for nearly regular graphs $G$ with maximum degree $Δ$, which is asymptotically optimal, as witnessed by the complete graphs. For proper colourings, we moreover show that $χ'_{\rm pOCF}(G) \le Δ+ O(\ln Δ)$ in the same regime. These results improve existing bounds stemming from related colouring models and transfer directly to random graphs' setting. The proofs combine decomposition techniques with probabilistic arguments and structural properties of edge neighbourhoods.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mateusz Kamyczura, Jakub Przybyło. 2026-01-25. On asymptotically tight bounds for the open conflict-free chromatic indexes of nearly regular graphs. https://arxiv.org/abs/2601.17827

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↗