BibTeX
CSL-JSON
MLA
Harvard
A tight Erdős-Pósa function for wheel minors
release_nw5c7wvihnfhzj5pnjlcjibssq
by
Pierre Aboulker, Samuel Fiorini, Tony Huynh, Gwenaël Joret,
Jean-Florent Raymond, Ignasi Sau
Released
as a article
.
2017
Abstract
Let W_t denote the wheel on t+1 vertices. We prove that for every integer
t ≥ 3 there is a constant c=c(t) such that for every integer k≥ 1
and every graph G, either G has k vertex-disjoint subgraphs each
containing W_t as minor, or there is a subset X of at most c k k
vertices such that G-X has no W_t minor. This is best possible, up to the
value of c. We conjecture that the result remains true more generally if we
replace W_t with any fixed planar graph H.
In text/plain
format
Archived Files and Locations
application/pdf 181.8 kB
file_q4iyf5ub4bcgpjnit2nsyykkeu
|
arxiv.org (repository) web.archive.org (webarchive) |
Read Archived PDF
Preserved and Accessible
arXiv
1710.06282v2
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
access all versions, variants, and formats of this works (eg, pre-prints)
Cite This
Lookup Links