Intermediate fractional colorability conjecture for subcubic triangle-free graphs
Let be a subcubic triangle-free graph, and let , , , and be the four specified graphs from the paper. Suppose that none of these graphs occurs as a subgraph of . A graph is fractionally -colorable when its fractional chromatic number is at most .
Intermediate fractional colorability conjecture. Every such graph is fractionally -colorable.
This conjecture is intermediate between the paper's theorem under exclusion of and and the stronger conjecture that additionally excludes , , , and . The supplied material gives no resolution status.
References
Primary source
Zdeněk Dvořák, Bernard Lidický and Luke Postle, “11/4-colorability of subcubic triangle-free graphs”, arXiv:2204.12683 (2025).
Progress summary
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.