The planar positive-valued cover conjecture

Let GG be a planar graph and let (H,f)(H,f) be a positive-valued cover. For each vertex vV(G)v\in V(G), suppose that s2s\geq 2 and

f(v,1)+f(v,2)++f(v,s)5.f(v,1)+f(v,2)+\dots+f(v,s)\geq 5.

Planar positive-valued cover conjecture. Under these assumptions, HH has a strictly ff-degenerate transversal.

This conjecture would remove the restriction that the range of ff is contained in {0,1,2}\{0,1,2\} from the preceding results and would imply Thomassen's theorems that every planar graph can be partitioned into an independent set and a 33-degenerate graph, and into a forest and a 22-degenerate graph. Its resolution status is not specified in the supplied source context.

Sources & referencesView supporting material

Primary source

Lingxi Li and Tao Wang, “An extension of Thomassen's result on choosability”, arXiv:2111.15220 (2022).

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.