Brunel University Research Archive(BURA) preserves and enables easy and open access to all
types of digital content. It showcases Brunel's research outputs.
Research contained within BURA is open access, although some publications may be subject
to publisher imposed embargoes. All awarded PhD theses are also archived on BURA.
Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/7062Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Chun, C | - |
| dc.contributor.author | Ding, G | - |
| dc.date.accessioned | 2012-12-11T10:03:50Z | - |
| dc.date.available | 2012-12-11T10:03:50Z | - |
| dc.date.issued | 2010 | - |
| dc.identifier.citation | Discrete Mathematics, 310(24): 3512 - 3522, Dec 2010 | en_US |
| dc.identifier.issn | 0012-365X | - |
| dc.identifier.uri | http://www.sciencedirect.com/science/article/pii/S0012365X10003389 | en |
| dc.identifier.uri | http://bura.brunel.ac.uk/handle/2438/7062 | - |
| dc.description | This is the post-print version of the Article - Copyright @ 2010 Elsevier | en_US |
| dc.description.abstract | A graph G is loosely-c-connected, or ℓ-c-connected, if there exists a number d depending on G such that the deletion of fewer than c vertices from G leaves precisely one infinite component and a graph containing at most d vertices. In this paper, we give the structure of a set of ℓ-c-connected infinite graphs that form an unavoidable set among the topological minors of ℓ-c-connected infinite graphs. Corresponding results for minors and parallel minors are also obtained. | en_US |
| dc.description.sponsorship | This study was supported in part by NSF grants DMS-1001230 and NSA grant H98230-10-1-0186 | en_US |
| dc.language | English | - |
| dc.language.iso | en | en_US |
| dc.publisher | Elsevier | en_US |
| dc.subject | Infinite graph | en_US |
| dc.subject | Unavoidable minor | en_US |
| dc.subject | Infinity lemma | en_US |
| dc.subject | Ramsey theory | en_US |
| dc.title | Unavoidable topological minors of infinite graphs | en_US |
| dc.type | Article | en_US |
| dc.identifier.doi | http://dx.doi.org/10.1016/j.disc.2010.08.014 | - |
| pubs.organisational-data | /Brunel | - |
| pubs.organisational-data | /Brunel/Brunel Active Staff | - |
| pubs.organisational-data | /Brunel/Brunel Active Staff/School of Info. Systems, Comp & Maths | - |
| Appears in Collections: | Publications Dept of Mathematics Research Papers Mathematical Sciences | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Fulltext.pdf | 251.52 kB | Adobe PDF | View/Open |
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.