Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/7063
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chun, C | - |
dc.contributor.author | Oxley, J | - |
dc.date.accessioned | 2012-12-11T10:29:48Z | - |
dc.date.available | 2012-12-11T10:29:48Z | - |
dc.date.issued | 2011 | - |
dc.identifier.citation | European Journal of Combinatorics, 32(6): 762 - 774, Aug 2011 | en_US |
dc.identifier.issn | 0195-6698 | - |
dc.identifier.uri | http://www.sciencedirect.com/science/article/pii/S0195669811000370 | en |
dc.identifier.uri | http://bura.brunel.ac.uk/handle/2438/7063 | - |
dc.description | This is the post-print version of the Article - Copyright @ 2011 Elsevier | en_US |
dc.description.abstract | We prove that, for each positive integer k, every sufficiently large 3-connected regular matroid has a parallel minor isomorphic to M (K_{3,k}), M(W_k), M(K_k), the cycle matroid of the graph obtained from K_{2,k} by adding paths through the vertices of each vertex class, or the cycle matroid of the graph obtained from K_{3,k} by adding a complete graph on the vertex class with three vertices. | en_US |
dc.description.sponsorship | This study is partially supported by a grant from the National Security Agency. | en_US |
dc.language | English | - |
dc.language.iso | en | en_US |
dc.publisher | Elsevier | en_US |
dc.title | Unavoidable parallel minors of regular matroids | en_US |
dc.type | Article | en_US |
dc.identifier.doi | http://dx.doi.org/10.1016/j.ejc.2011.02.008 | - |
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 | 201.89 kB | Adobe PDF | View/Open |
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.