The planar graph positive-valued cover degeneracy conjecture
The planar graph positive-valued cover degeneracy conjecture
Let be a planar graph and let be a positive-valued cover, meaning that the cover function is positive-valued. Let . A strictly -degenerate transversal is a transversal of inducing, in every nonempty subgraph, a vertex whose degree is less than its assigned -value. The planar graph positive-valued cover conjecture. If
for each , then has a strictly -degenerate transversal. This would extend the stated partition theorem and its corollary from two degenerate parts to arbitrary positive-valued covers with at least two parts; the conjecture remains open.
Sources & referencesView supporting material
Primary source
Fangyao Lu, Qianqian Wang and Tao Wang, “Cover and variable degeneracy”, arXiv:1907.06630 (2021).
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
Sign in to submit a solution.
No solutions have been posted yet.