Search

Since its beginnings, every Cycles and Colourings workshop holds one or two open problem sessions; this document contains the problems (together with notes regarding the current state of the art and related bibliography) presented by participants of the 32nd edition of the workshop which took place in Poprad, Slovakia during September 8-13, 2024 (see the workshop webpage https://candc.upjs.sk)., Comment: Problems presented during the problem sessions of the 32nd Workshop on Cycles and Colours (Poprad, Slovakia, 8-13 September 2024)

A recent result by Kardo\v{s}, M\'a\v{c}ajov\'a and Zerafa [J. Comb. Theory, Ser. B. 160 (2023) 1--14] related to the famous Berge-Fulkerson conjecture implies that given an arbitrary set of odd pairwise edge-disjoint cycles, say $\mathcal O$, in a bridgeless cubic graph, there exists a $1$-factor intersecting all cycles in $\mathcal O$ in at least one edge. This remarkable result opens up natural generalizations in the case of an $r$-regular graph $G$ and a $t$-factor $F$, with $r$ and $t$ being positive integers. In this paper, we start the study of this problem by proving necessary and sufficient conditions on $G$, $t$ and $r$ to assure the existence of a suitable $F$ for any possible choice of the set $\mathcal O$. First of all, we show that $G$ needs to be $2$-connected. Under this additional assumption, we highlight how the ratio $\frac{t}{r}$ seems to play a crucial role in assuring the existence of a $t$-factor $F$ with the required properties by proving that $\frac{t}{r} \geq \frac{1}{3}$ is a further necessary condition. We suspect that this condition is also sufficient, and we confirm it in the case $\frac{t}{r}=\frac{1}{3}$, generalizing the case $t=1$ and $r=3$ proved by Kardo\v{s}, M\'a\v{c}ajov\'a, Zerafa, and in the case $\frac{t}{r}=\frac{1}{2}$ with $t$ even. Finally, we provide further results in the case of cycles of arbitrary length., Comment: 17 pages

Petersen's seminal work in 1891 asserts that the edge-set of a cubic graph can be covered by distinct perfect matchings if and only if it is bridgeless. Actually, it is known that for a very large fraction of bridgeless cubic graphs, every edge belongs to at least two distinct perfect matchings. In this paper, we study the class of non-double covered cubic graphs, i.e.\ graphs having an edge, called lonely edge, which belongs to exactly one perfect matching. First of all, we provide a reduction of the problem to the subclass $\cal U$ of $3$-connected cubic graphs. Then, we furnish an inductive characterization of $\cal U$ and we study properties related to the count of lonely edges. In particular, denoting by $\mathcal{U}_k$ the subclass of graphs of $\cal U$ with exactly $k$ lonely edges, we prove that $\mathcal{U}_k$ is empty for $k>6$, and we present a complete characterization for $3 \leq k \leq 6$. The paper concludes with some insights on ${\cal U}_1$ and ${\cal U}_2$., Comment: 20 pages, 17 figures

An $r$-regular graph is an $r$-graph, if every odd set of vertices is connected to its complement by at least $r$ edges. Let $G$ and $H$ be $r$-graphs. An $H$-coloring of $G$ is a mapping $f\colon E(G) \to E(H)$ such that each $r$ adjacent edges of $G$ are mapped to $r$ adjacent edges of $H$. For every $r\geq 3$, let $\mathcal{H}_r$ be an inclusion-wise minimal set of connected $r$-graphs, such that for every connected $r$-graph $G$ there is an $H \in \mathcal{H}_r$ which colors $G$. We show that $\mathcal{H}_r$ is unique and characterize $\mathcal{H}_r$ by showing that $G \in \mathcal{H}_r$ if and only if the only connected $r$-graph coloring $G$ is $G$ itself. The Petersen Coloring Conjecture states that the Petersen graph $P$ colors every bridgeless cubic graph. We show that if true, this is a very exclusive situation. Indeed, either $\mathcal{H}_3 = \{P\}$ or $\mathcal{H}_3$ is an infinite set and if $r \geq 4$, then $\mathcal{H}_r$ is an infinite set. Similar results hold for the restriction on simple $r$-graphs. By definition, $r$-graphs of class $1$ (i.e. those having edge-chromatic number equal to $r$) can be colored with any $r$-graph. Hence, our study will focus on those $r$-graphs whose edge-chromatic number is bigger than $r$, also called $r$-graphs of class $2$. We determine the set of smallest $r$-graphs of class 2 and show that it is a subset of $\mathcal{H}_r$., Comment: 25 pages, 7 figures

A $d$-dimensional nowhere-zero $r$-flow on a graph $G$, an $(r,d)$-NZF from now on, is a flow where the value on each edge is an element of $\mathbb{R}^d$ whose (Euclidean) norm lies in the interval $[1,r-1]$. Such a notion is a natural generalization of the well-known concept of circular nowhere-zero $r$-flow (i.e.\ $d=1$). For every bridgeless graph $G$, the $5$-flow Conjecture claims that $\phi_1(G)\leq 5$, while a conjecture by Jain suggests that $\phi_d(G)=1$, for all $d \geq 3$. Here, we address the problem of finding a possible upper-bound also for the remaining case $d=2$. We show that, for all bridgeless graphs, $\phi_2(G) \le 1 + \sqrt{5}$ and that the oriented $5$-cycle double cover Conjecture implies $\phi_2(G)\leq \tau^2$, where $\tau$ is the Golden Ratio. Moreover, we propose a geometric method to describe an $(r,2)$-NZF of a cubic graph in a compact way, and we apply it in some instances. Our results and some computational evidence suggest that $\tau^2$ could be a promising upper bound for the parameter $\phi_2(G)$ for an arbitrary bridgeless graph $G$. We leave that as a relevant open problem which represents an analogous of the $5$-flow Conjecture in the $2$-dimensional case (i.e. complex case)., Comment: 14 pages, 4 figures

Let $r \geq 2$ be a real number. A complex nowhere-zero $r$-flow on a graph $G$ is an orientation of $G$ together with an assignment $\varphi\colon E(G)\to \mathbb{C}$ such that, for all $e \in E(G)$, the modulus of the complex number $\varphi(e)$ lies in the interval $[1,r-1]$ and, for every vertex, the incoming flow is equal to the outgoing flow. The complex flow number of a bridgeless graph $G$, denoted by $\phi_{\mathbb{C}}(G)$, is the minimum of the real numbers $r$ such that $G$ admits a complex nowhere-zero $r$-flow. The exact computation of $\phi_{\mathbb{C}}$ seems to be a hard task even for very small and symmetric graphs. In particular, the exact value of $\phi_{\mathbb{C}}$ is known only for families of graphs where a lower bound can be trivially proved. Here, we use geometric and combinatorial arguments to give a non trivial lower bound for $\phi_{\mathbb{C}}(G)$ in terms of the odd-girth of a cubic graph $G$ (i.e. the length of a shortest odd cycle) and we show that such lower bounds are tight. Our main result, Theorem 2, relies on the exact computation of the complex flow number of the wheel graph $W_n$ (see Theorem 1). In particular, we show that for every odd $n$, the value of $\phi_{\mathbb{C}}(W_n)$ arises from one of three suitable configurations of points in the complex plane according to the congruence of $n$ modulo $6$., Comment: 24 pages, 10 figures

Given an edge-coloring of a graph $G$, we associate to every vertex $v$ of $G$ the set of colors appearing on the edges incident with $v$. The palette index of $G$ is defined as the minimum number of such distinct sets, taken over all possible edge-colorings of $G$. A graph with a small palette index admits an edge-coloring which can be locally considered to be almost symmetric, since few different sets of colors appear around its vertices. Graphs with palette index $1$ are $r$-regular graphs admitting an $r$-edge-coloring, while regular graphs with palette index $2$ do not exist. Here, we characterize all graphs with palette index either $2$ or $3$ in terms of the existence of suitable decompositions in regular subgraphs. As a corollary, we obtain a complete characterization of regular graphs with palette index $3$., Comment: 14 pages, 5 figures

Thomassen [Problem 1 in Factorizing regular graphs, J. Combin. Theory Ser. B, 141 (2020), 343-351] asked whether every $r$-edge-connected $r$-regular graph of even order has $r-2$ pairwise disjoint perfect matchings. We show that this is not the case if $r \equiv 2 \text{ mod } 4$. Together with a recent result of Mattiolo and Steffen [Highly edge-connected regular graphs without large factorizable subgraphs, J. Graph Theory, 99 (2022), 107-116] this solves Thomassen's problem for all even $r$. It turns out that our methods are limited to the even case of Thomassen's problem. We then prove some equivalences of statements on pairwise disjoint perfect matchings in highly edge-connected regular graphs, where the perfect matchings contain or avoid fixed sets of edges. Based on these results we relate statements on pairwise disjoint perfect matchings of 5-edge-connected 5-regular graphs to well-known conjectures for cubic graphs, such as the Fan-Raspaud Conjecture, the Berge-Fulkerson Conjecture and the $5$-Cycle Double Cover Conjecture., Comment: 24 pages

Given an edge-coloring of a graph, the palette of a vertex is defined as the set of colors of the edges which are incident with it. We define the palette index of a graph as the minimum number of distinct palettes, taken over all edge-colorings, occurring among the vertices of the graph. Several results about the palette index of some specific classes of graphs are known. In this paper we propose a different approach that leads to new and more general results on the palette index. Our main theorem gives a sufficient condition for a graph to have palette index larger than its minimum degree. In the second part of the paper, by using such a result, we answer to two open problems on this topic. First, for every $r$ odd, we construct a family of $r$-regular graphs with palette index reaching the maximum admissible value. After that, we construct the first known family of simple graphs whose palette index grows quadratically with respect to their maximum degree., Comment: 7 pages, 1 figure

If $f:\mathbb{N}\rightarrow \mathbb{N}$ is a function, then let us say that $f$ is sublinear if \[\lim_{n\rightarrow +\infty}\frac{f(n)}{n}=0.\] If $G=(V,E)$ is a cubic graph and $c:E\rightarrow \{1,...,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 $N_G(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:\mathbb{N}\rightarrow \mathbb{N}$, such that all bridgeless cubic graphs admit a proper 5-edge-coloring $c$ with $|N_G(c)|\leq f(|V|)$; (b) for $k=2,3,4$, the statement that there is a sublinear function $f:\mathbb{N}\rightarrow \mathbb{N}$, such that all (cyclically) $k$-edge-connected cubic graphs admit a proper 5-edge-coloring $c$ with $|N_G(c)|\leq f(|V|)$ is equivalent to the statement that all (cyclically) $k$-edge-connected cubic graphs admit a proper 5-edge-coloring $c$ with $|N_G(c)|\leq 2k+1$., Comment: 10 pages, 4 figures

Let $\phi_c(G)$ be the circular flow number of a bridgeless graph $G$. In [Edge-colorings and circular flow numbers of regular graphs, J. Graph Theory 79 (2015) 1-7] it was proved that, for every $t \geq 1$, $G$ is a bridgeless $(2t+1)$-regular graph with $\phi_c(G) \in \{2+\frac{1}{t}, 2 + \frac{2}{2t-1}\}$ if and only if $G$ has a perfect matching $M$ such that $G-M$ is bipartite. This implies that $G$ is a class 1 graph. For $t=1$, all graphs with circular flow number bigger than 4 are class 2 graphs. We show for all $t \geq 1$, that $2 + \frac{2}{2t-1} = \inf \{ \phi_c(G)\colon G \text{ is a } (2t+1) \text{-regular class } 2 \text{ graph}\}$. This was conjectured to be true in [Edge-colorings and circular flow numbers of regular graphs, J. Graph Theory 79 (2015) 1-7]. Moreover we prove that $\inf\{ \phi_c(G)\colon G $ is a $ (2t+1)$-regular class $1$ graph with no perfect matching whose removal leaves a bipartite graph$ \} = 2 + \frac{2}{2t-1}$. We further disprove the conjecture that every $(2t+1)$-regular class $1$ graph has circular flow number at most $2+\frac{2}{t}$., Comment: 17 pages; submitted for publication

We construct highly edge-connected $r$-regular graph which do not contain $r-2$ pairwise disjoint perfect matchings. The results partially answer a question stated by Thomassen [Factorizing regular graphs, J. Comb. Theory Ser. B (2019), https://doi.org/10.1016/j.jctb.2019.05.002 (article in press)]., Comment: 10 pages; submitted for publication

It is well-known that the circular flow number of a bridgeless cubic graph can be computed in terms of certain partitions of its vertex-set with prescribed properties. In the present paper, we first study some of these properties that turn out to be useful in order to design a more efficient algorithm for the computation of the circular flow number of a bridgeless cubic graph. Using this algorithm, we determine the circular flow number of all snarks up to 36 vertices as well as the circular flow number of various famous snarks. After that, as combination of the use of our algorithm with new theoretical results, we present an infinite family of snarks of order $8k+2$ whose circular flow numbers meet a general lower bound presented by Lukot'ka and Skoviera in 2008. In particular, this answers a question proposed in their paper. Moreover, we improve the best known upper bound for the circular flow number of Goldberg snarks and we conjecture that this new upper bound is optimal. Finally, we discuss a possible extension to the computation of the circular flow number in the non-regular case., Comment: 20 pages; submitted for publication

The well-known 5-flow Conjecture of Tutte, stated originally for integer flows, claims that every bridgeless graph has circular flow number at most 5. It is a classical result that the study of the 5-flow Conjecture can be reduced to cubic graphs, in particular to snarks. However, very few procedures to construct snarks with circular flow number 5 are known. In the first part of this paper, we summarise some of these methods and we propose new ones based on variations of the known constructions. Afterwards, we prove that all such methods are nothing but particular instances of a more general construction that we introduce into detail. In the second part, we consider many instances of this general method and we determine when our method permits to obtain a snark with circular flow number 5. Finally, by a computer search, we determine all snarks having circular flow number 5 up to 36 vertices. It turns out that all such snarks of order at most 34 can be obtained by using our method, and that the same holds for 96 of the 98 snarks of order 36 with circular flow number 5., Comment: 27 pages; submitted for publication