On Gupta's Co-density Conjecture
Combinatorics
2019-06-18 v1
Abstract
Let be a multigraph. The {\em cover index} of is the greatest integer for which there is a coloring of with colors such that each vertex of is incident with at least one edge of each color. Let be the minimum degree of and let be the {\em co-density} of , defined by where is the set of all edges of with at least one end in . It is easy to see that . In 1978 Gupta proposed the following co-density conjecture: Every multigraph satisfies , which is the dual version of the Goldberg-Seymour conjecture on edge-colorings of multigraphs. In this note we prove that if is not integral and otherwise. We also show that this co-density conjecture implies another conjecture concerning cover index made by Gupta in 1967.
Keywords
Cite
@article{arxiv.1906.06458,
title = {On Gupta's Co-density Conjecture},
author = {Yan Cao and Guantao Chen and Guoli Ding and Guangming Jing and Wenan Zang},
journal= {arXiv preprint arXiv:1906.06458},
year = {2019}
}