|
|||||
|
|
Partitioning a Planar Graph of Girth 10 into a Forest and a Matching |
|
| Authors: | A. Bassa J. Burns J. Campbell A. Deshpande J. Farley M. Halsey S.‐Y. Ho D. Kleitman S. Michalakis P.‐O. Persson P. Pylyavskyy L. Rademacher A. Riehl M. Rios J. Samuel B. E. Tenner A. Vijayasarathy L. Zhao |
| Affiliation: | Massachusetts Institute of Technology |
| Abstract: | We prove that any finite planar graph with girth at least 10 can have its edges partitioned to form two graphs on the same vertices, one of which is a forest, and the other of which is a matching. Several related results are also demonstrated. |
| Keywords: | |