← All problems

Weighted fractional coloring conjecture for intersections of matroids

1 year old · documented by

Let L={M1,…,Mk}∈Dk\mathcal{L}=\{\mathcal{M}_1,\ldots,\mathcal{M}_k\}\in\mathcal{D}^k be matroids on VV, let C=⋂L\mathcal{C}=\bigcap\mathcal{L}, and let h⃗∈R≥0V\vec h\in\mathbb{R}_{\ge0}^V. Weighted fractional coloring conjecture. One has

χ∗(C,h⃗)≤(k−1)max⁡1≤i≤kχ∗(Mi,h⃗).\chi^*(\mathcal{C},\vec h)\le (k-1)\max_{1\le i\le k}\chi^*(\mathcal{M}_i,\vec h).

The source states this as an equivalent formulation of the weighted matching-cover conjecture. It is proved for partition matroids, while the general case remains open.

References
  1. Ron Aharoni, Eli Berger, He Guo and Dani Kotlar, “Coloring, list coloring, and fractional coloring in intersections of matroids”, arXiv:2407.08789 (2025).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.