On sublinear approximations for the Petersen coloring conjecture

From MaRDI portal
Publication:4959474

zbMATH Open1472.05057arXiv2104.09241MaRDI QIDQ4959474FDOQ4959474


Authors: Davide Mattiolo, Vahan V. Mkrtchyan, G. Mazzuoccolo Edit this on Wikidata


Publication date: 13 September 2021

Abstract: If f:mathbbNightarrowmathbbN is a function, then let us say that f is sublinear if [lim_{n ightarrow +infty}frac{f(n)}{n}=0.] If G=(V,E) is a cubic graph and c:Eightarrow1,...,k is a proper k-edge-coloring of G, then an edge e=uv of G is poor (rich) in c, if the edges incident to u and v are colored with three (five) colors. An edge is abnormal if it is neither rich nor poor. The Petersen coloring conjecture of Jaeger states that any bridgeless cubic graph admits a proper 5-edge-coloring c, such that there is no an abnormal edge of G with respect to c. For a proper 5-edge-coloring c of G, let NG(c) be the set of abnormal edges of G with respect to c. In this paper we show that (a) The Petersen coloring conjecture is equivalent to the statement that there is a sublinear function f:mathbbNightarrowmathbbN, such that all bridgeless cubic graphs admit a proper 5-edge-coloring c with |NG(c)|leqf(|V|); (b) for k=2,3,4, the statement that there is a sublinear function f:mathbbNightarrowmathbbN, such that all (cyclically) k-edge-connected cubic graphs admit a proper 5-edge-coloring c with |NG(c)|leqf(|V|) is equivalent to the statement that all (cyclically) k-edge-connected cubic graphs admit a proper 5-edge-coloring c with |NG(c)|leq2k+1.


Full work available at URL: https://arxiv.org/abs/2104.09241




Recommendations





Cited In (4)





This page was built for publication: On sublinear approximations for the Petersen coloring conjecture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4959474)