Kowalik et al.'s conjecture on induced forests in planar graphs of girth at least five
Let be a finite simple planar graph of order and girth at least , where the girth is the length of a shortest cycle.
Kowalik et al.'s conjecture. The graph admits an induced forest of order at least
This conjecture seeks a stronger induced-forest bound for planar graphs excluding short cycles. The source describes a companion result as a first step toward the conjecture, but does not state that the conjecture has been resolved.
References
2 papers in this index state this conjecture (2014–2015). The statement above is taken from the most recent of them; the others are arXiv:1409.1348.
Source: François Dross, Mickael Montassier and Alexandre Pinlou, “A lower bound on the order of the largest induced forest in planar graphs with high girth”, arXiv:1504.01949 (2015).
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.