Search arXivSearch

arXiv · 1906.06458

On Gupta's Co-density Conjecture

Abstract

Let $G=(V,E)$ be a multigraph. The {\em 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 {\em co-density} of $G$, defined by \[Φ(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)$ is the set of all edges of $G$ with at least one end in $U$. It is easy to see that $ξ(G) \le \min\{δ(G), \lfloor Φ(G) \rfloor\}$. In 1978 Gupta proposed the following co-density conjecture: Every multigraph $G$ satisfies $ξ(G)\ge \min\{δ(G)-1, \, \lfloor Φ(G) \rfloor\}$, which is the dual version of the Goldberg-Seymour conjecture on edge-colorings of multigraphs. In this note we prove that $ξ(G)\ge \min\{δ(G)-1, \, \lfloor Φ(G) \rfloor\}$ if $Φ(G)$ is not integral and $ξ(G)\ge \min\{δ(G)-2, \, \lfloor Φ(G) \rfloor-1\}$ otherwise. We also show that this co-density conjecture implies another conjecture concerning cover index made by Gupta in 1967.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yan Cao, Guantao Chen, Guoli Ding, Guangming Jing, Wenan Zang. 2019-06-15. On Gupta's Co-density Conjecture. https://arxiv.org/abs/1906.06458

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Orthogonal Pairs in Maps from the Sphere to the Circle

We prove that, for any $f:S^2\to S^1$ and any $\varepsilon>0$, there exist orthogonal vectors $x,y\in S^2$ such that the length of the shortest arc between $f(x)$ and $f(y)$ is at most $π/2 +\varepsilon$. This proves a conjecture of Ghebleh from 2007 that the circular chromatic number of the real orthogonality graph is equal to four.

math.CO

Exact Area-Range Minima in the Quantitative Monsky Problem for Five and Seven Triangles

For a dissection $D$ of the unit square into $n$ nondegenerate triangles, let $R(D)=\max_i a_i-\min_i a_i, Δ(n)=\inf_D R(D).$ We prove that this infimum is attained for every $n\ge2$, and determine the exact minima for $n=5$ and $n=7$, allowing T-junctions. For five triangles, $Δ(5)=\frac{5\sqrt5-11}{8};$ equality holds precisely when three areas equal $(3-\sqrt5)/4$ and two equal $(3\sqrt5-5)/8$. For seven triangles, $Δ(7)=r_7$, where $r_7$ is the unique root in $(0,1/4900)$ of $864r^4+2160r^3-6060r^2+4972r-1.$ Every minimizer has four areas $(1+3r_7)/7$ and three areas $(1-4r_7)/7$, although its geometry need not be unique. The proofs combine finite combinatorial classification with exact symbolic and integer-interval certificates. For nine triangles, a tilted-strip construction gives the explicit algebraic upper bound $Δ(9)\le 0.0001273496861283553341\ldots,$ which is the exact minimum within that topology. Conversely, every dissection in the complete single-cap two-rail zig-zag family, with arbitrary continuous areas, has range greater than $1/3500$; hence a global minimizer must lie outside that family. The exact value of $Δ(9)$ remains open.

math.CO

Chromatic symmetric functions for annular webs

We introduce a combinatorial definition of chromatic symmetric functions for annular webs. We prove their symmetry by constructing a web analogue of the Shareshian--Wachs involution and show that they coincide with the symmetric functions associated to annular webs via Turaev's isomorphism. We then derive explicit formulas for their hook Schur coefficients. We also introduce web LLT functions, whose hook Schur coefficients admit positive Laurent-polynomial formulas. These formulas yield a combinatorial expression for the coefficients of the HOMFLY--PT polynomial of an annular web.

math.CO