![](/files/happy5.png)
Lee, Chuan-Min
Jones' conjecture ★★
For a graph , let
denote the cardinality of a maximum cycle packing (collection of vertex disjoint cycles) and let
denote the cardinality of a minimum feedback vertex set (set of vertices
so that
is acyclic).
Conjecture For every planar graph
,
.
![$ G $](/files/tex/b8e7ad0330f925492bf468b5c379baec88cf1b3d.png)
![$ cc(G)\leq 2cp(G) $](/files/tex/c3407aab8c5dd67b27ec62b418dcd71d7b6fb886.png)
Keywords: cycle packing; feedback vertex set; planar graph
![Syndicate content Syndicate content](/misc/feed.png)