Rooted grid minors

Author(s): Marx, Daniel; Seymour, Paul D; Wollan, Paul

Download

To refer to this page use: http://arks.princeton.edu/ark:/88435/pr1gq6r22v

Full metadata record

DC Field	Value	Language
dc.contributor.author	Marx, Daniel	-
dc.contributor.author	Seymour, Paul D	-
dc.contributor.author	Wollan, Paul	-
dc.date.accessioned	2023-10-27T17:48:06Z	-
dc.date.available	2023-10-27T17:48:06Z	-
dc.date.issued	2017-01	en_US
dc.identifier.citation	Marx, Daniel, Seymour, Paul, Wollan, Paul. (2017). Rooted grid minors. JOURNAL OF COMBINATORIAL THEORY SERIES B, 122 (428 - 437. doi:10.1016/j.jctb.2016.07.003	en_US
dc.identifier.issn	0095-8956	-
dc.identifier.uri	http://arks.princeton.edu/ark:/88435/pr1gq6r22v	-
dc.description.abstract	Intuitively, a tangle of large order in a graph is a highly connected part of the graph, and it is known that if a graph has a tangle of large order then it has a large grid minor. Here we show that for any k, if G has a tangle of large order and Z is a set of vertices of cardinality k that cannot be separated from the tangle by any separation of order less than k, then G has a large grid minor containing Z, in which the members of Z all belong to the outside of the grid. (C) 2016 Elsevier Inc. All rights reserved.	en_US
dc.format.extent	428 - 437	en_US
dc.language.iso	en_US	en_US
dc.relation.ispartof	JOURNAL OF COMBINATORIAL THEORY SERIES B	en_US
dc.rights	Author's manuscript	en_US
dc.title	Rooted grid minors	en_US
dc.type	Journal Article	en_US
dc.identifier.doi	doi:10.1016/j.jctb.2016.07.003	-
dc.date.eissued	2016-07-26	en_US
dc.identifier.eissn	1096-0902	-
pu.type.symplectic	http://www.symplectic.co.uk/publications/atom-terms/1.0/journal-article	en_US

Files in This Item:

File	Description	Size	Format
1307.8138.pdf		101.19 kB	Adobe PDF	View/Download