English

On Gupta's Co-density Conjecture

Combinatorics 2019-06-18 v1

Abstract

Let G=(V,E)G=(V,E) be a multigraph. The {\em cover index} ξ(G)\xi(G) of GG is the greatest integer kk for which there is a coloring of EE with kk colors such that each vertex of GG is incident with at least one edge of each color. Let δ(G)\delta(G) be the minimum degree of GG and let Φ(G)\Phi(G) be the {\em co-density} of GG, defined by Φ(G)=min{2E+(U)U+1:UV,U3andodd},\Phi(G)=\min \Big\{\frac{2|E^+(U)|}{|U|+1}:\,\, U \subseteq V, \,\, |U|\ge 3 \hskip 2mm {\rm and \hskip 2mm odd} \Big\}, where E+(U)E^+(U) is the set of all edges of GG with at least one end in UU. It is easy to see that ξ(G)min{δ(G),Φ(G)}\xi(G) \le \min\{\delta(G), \lfloor \Phi(G) \rfloor\}. In 1978 Gupta proposed the following co-density conjecture: Every multigraph GG satisfies ξ(G)min{δ(G)1,Φ(G)}\xi(G)\ge \min\{\delta(G)-1, \, \lfloor \Phi(G) \rfloor\}, which is the dual version of the Goldberg-Seymour conjecture on edge-colorings of multigraphs. In this note we prove that ξ(G)min{δ(G)1,Φ(G)}\xi(G)\ge \min\{\delta(G)-1, \, \lfloor \Phi(G) \rfloor\} if Φ(G)\Phi(G) is not integral and ξ(G)min{δ(G)2,Φ(G)1}\xi(G)\ge \min\{\delta(G)-2, \, \lfloor \Phi(G) \rfloor-1\} 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}
}
R2 v1 2026-06-23T09:54:23.552Z