Erdös--Pósa Property for Labeled Minors: 2-Connected Minors

Autor:	Oliver Schaudt, Henning Bruhn, Felix Joos
Rok vydání:	2021
Předmět:	Combinatorics Discrete mathematics Mathematics::Combinatorics Property (philosophy) 010201 computation theory & mathematics General Mathematics Graph minor Duality (optimization) 0102 computer and information sciences 01 natural sciences Mathematics
Zdroj:	SIAM Journal on Discrete Mathematics. 35:893-914
ISSN:	1095-7146 0895-4801
DOI:	10.1137/19m1289340
Popis:	In the 1960s, Erdos and Posa proved that there is a packing-covering duality for cycles in graphs. As part of the graph minor project, Robertson and Seymour greatly extended this: there is such a d...
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::b67ff429e9928b8e4897bc884d4da96d https://doi.org/10.1137/19m1289340 Zobrazit plný text záznamu