Conjecture on matroidal 3-colorability of paths
A graph is matroidally -colorable if, for every -coverable matroid on the vertex set of , the vertex set can be decomposed into stable sets of that are independent in .
Path 3-colorability conjecture. Every path is matroidally -colorable.
The claim is presented as a consequence of the Aharoni–Berger conjecture for cycles together with the subgraph property for matroidally colorable graphs. Its status is not resolved in the supplied text.
References
- Kristóf Bérczi and Tamás Schwarcz, “Partitioning into common independent sets via relaxing strongly base orderability”, arXiv:2302.01445 (2023).
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.