Gupta's co-density conjecture for multigraph cover index
Statement
Let be a multigraph. Its cover index is the maximum number of pairwise disjoint edge covers of , and its minimum degree is . Define the co-density by
\Phi(G)=\min\left\\{\frac{2|E^+(U)|}{|U|+1}: U\subseteq V,\ |U|\geq 3\text{ and odd}\right\\},where consists of the edges with at least one end in . Gupta's co-density conjecture. Every multigraph satisfies
The conjecture is the cover-packing counterpart of the Goldberg–Seymour edge-coloring conjecture. Its validity would constrain the cover index to two possible values relative to the fractional cover index; the paper reports only approximate bounds as known.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.