Fractional Akiyama–Watanabe conjecture for triangle-free planar graphs
Fractional Akiyama–Watanabe conjecture for triangle-free planar graphs
Let be a triangle-free planar graph, and let denote its fractional vertex-arboricity. Fractional Akiyama–Watanabe conjecture. Every triangle-free planar graph has fractional vertex-arboricity at most , that is,
This generalizes the Akiyama–Watanabe conjecture from bipartite planar graphs to the weaker triangle-free condition. The corresponding induced-forest conjecture remains open; the paper records the best known partial bounds and proposes this fractional strengthening.
Sources & referencesView supporting material
Primary source
Marthe Bonamy, František Kardoš, Tom Kelly and Luke Postle, “Fractional vertex-arboricity of planar graphs”, arXiv:2009.12189 (2020).
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.