On the f-matching polytope and the fractional f-chromatic index
classification
🧮 math.CO
keywords
fractionalchromaticindexformulamatchingpolytopedescriptionmaximum
read the original abstract
Our motivation is the question of how similar the $f$-colouring problem is to the classic edge-colouring problem, particularly with regard to graph parameters. In 2010, Zhang, Yu, and Liu gave a new description of the $f$-matching polytope and derived a formula for the fractional $f$-chromatic index, stating that the fractional $f$-chromatic index equals the maximum of the fractional maximum $f$-degree and the fractional $f$-density. Unfortunately, this formula is incorrect. We present counterexamples for both the description of the $f$-matching polytope and the formula for the fractional $f$-chromatic index. Finally, we prove a short lemma concerning the generalization of Goldberg's conjecture.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.