Jones’ conjecture in subcubic graphs

Marthe Bonamy; François Dross; Tomáš Masařík; Andrea Munaro; Wojciech Nadara; Marcin Pilipczuk; Micha̷l Pilipczuk

doi:10.37236/9192

Jones’ conjecture in subcubic graphs

Marthe Bonamy, François Dross, Tomáš Masařík, Andrea Munaro, Wojciech Nadara, Marcin Pilipczuk, Micha̷l Pilipczuk

School of Mathematics and Physics

Research output: Contribution to journal › Article › peer-review

33 Downloads (Pure)

Abstract

We confirm Jones’ Conjecture for subcubic graphs. Namely, if a subcubic planar graph does not contain k + 1 vertex-disjoint cycles, then it suffices to delete 2k vertices to obtain a forest.

Original language	English
Article number	P4.5
Journal	Electronic Journal of Combinatorics
Volume	28
Issue number	4
DOIs	https://doi.org/10.37236/9192
Publication status	Published - 08 Oct 2021

Bibliographical note

Funding Information:
∗This research is a part of projects that have received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme, Grant Agreements 677651 and 714704.

Publisher Copyright:
© The authors.

ASJC Scopus subject areas

Theoretical Computer Science
Geometry and Topology
Discrete Mathematics and Combinatorics
Computational Theory and Mathematics
Applied Mathematics

Access to Document

10.37236/9192Licence: CC BY

Jones' Conjecture in Subcubic Graphs
Copyright 2021 the authors. This is an open access article published under a Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution and reproduction in any medium, provided the author and source are cited.
Final published version, 262 KBLicence: CC BY

Cite this

@article{ae36114e418e452c88ce1f61cc45ebea,

title = "Jones{\textquoteright} conjecture in subcubic graphs",

abstract = "We confirm Jones{\textquoteright} Conjecture for subcubic graphs. Namely, if a subcubic planar graph does not contain k + 1 vertex-disjoint cycles, then it suffices to delete 2k vertices to obtain a forest.",

author = "Marthe Bonamy and Fran{\c c}ois Dross and Tom{\'a}{\v s} Masa{\v r}{\'i}k and Andrea Munaro and Wojciech Nadara and Marcin Pilipczuk and Micha̷l Pilipczuk",

note = "Funding Information: ∗This research is a part of projects that have received funding from the European Research Council (ERC) under the European Union{\textquoteright}s Horizon 2020 research and innovation programme, Grant Agreements 677651 and 714704. Publisher Copyright: {\textcopyright} The authors.",

year = "2021",

month = oct,

day = "8",

doi = "10.37236/9192",

language = "English",

volume = "28",

journal = "Electronic Journal of Combinatorics",

issn = "1077-8926",

publisher = "Electronic Journal of Combinatorics",

number = "4",

}

TY - JOUR

T1 - Jones’ conjecture in subcubic graphs

AU - Bonamy, Marthe

AU - Dross, François

AU - Masařík, Tomáš

AU - Munaro, Andrea

AU - Nadara, Wojciech

AU - Pilipczuk, Marcin

AU - Pilipczuk, Micha̷l

N1 - Funding Information: ∗This research is a part of projects that have received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme, Grant Agreements 677651 and 714704. Publisher Copyright: © The authors.

PY - 2021/10/8

Y1 - 2021/10/8

N2 - We confirm Jones’ Conjecture for subcubic graphs. Namely, if a subcubic planar graph does not contain k + 1 vertex-disjoint cycles, then it suffices to delete 2k vertices to obtain a forest.

AB - We confirm Jones’ Conjecture for subcubic graphs. Namely, if a subcubic planar graph does not contain k + 1 vertex-disjoint cycles, then it suffices to delete 2k vertices to obtain a forest.

U2 - 10.37236/9192

DO - 10.37236/9192

M3 - Article

AN - SCOPUS:85116549100

VL - 28

JO - Electronic Journal of Combinatorics

JF - Electronic Journal of Combinatorics

SN - 1077-8926

IS - 4

M1 - P4.5

ER -

Jones’ conjecture in subcubic graphs

Abstract

Bibliographical note

ASJC Scopus subject areas

Access to Document

Fingerprint

Cite this