3 papers
math.CO2023
Sets of -graphs that color all -graphs
Yulai Ma, Davide Mattiolo, Eckhard Steffen +1
An -regular graph is an -graph, if every odd set of vertices is connected to its complement by at least edges. Let and be -graphs. An -coloring of is a…
math.CO2023
On -dimensional nowhere-zero -flows on a graph
Davide Mattiolo, Giuseppe Mazzuoccolo, Jozef Rajník +1
A -dimensional nowhere-zero -flow on a graph , an -NZF from now on, is a flow where the value on each edge is an element of whose (Euclidean) norm li…
math.CO2023
A lower bound for the complex flow number of a graph: a geometric approach
Davide Mattiolo, Giuseppe Mazzuoccolo, Jozef Rajník +1
Let be a real number. A complex nowhere-zero -flow on a graph is an orientation of together with an assignment such that, for all…