On Gupta's Co-density Conjecture

Abstract

Let G=(V,E) be a multigraph. The cover index (G) of G is the greatest integer k for which there is a coloring of E with k colors such that each vertex of G is incident with at least one edge of each color. Let δ(G) be the minimum degree of G and let (G) be the co-density of G, defined by \[(G)= \2|E+(U)||U|+1:\,\, U ⊂eq V, \,\, |U| 3 2mm and 2mm odd \,\] where E+(U) is the set of all edges of G with at least one end in U. It is easy to see that (G) \δ(G), (G) \. In 1978 Gupta proposed the following co-density conjecture: Every multigraph G satisfies (G) \δ(G)-1, \, (G) \, which is the dual version of the Goldberg-Seymour conjecture on edge-colorings of multigraphs. In this note we prove that (G) \δ(G)-1, \, (G) \ if (G) is not integral and (G) \δ(G)-2, \, (G) -1\ otherwise. We also show that this co-density conjecture implies another conjecture concerning cover index made by Gupta in 1967.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…