Nick Brettell
N-detachable pairs in 3-connected matroids I: Unveiling X
Brettell, Nick; Whittle, Geoff; Williams, Alan
Authors
Geoff Whittle
Alan Williams
Abstract
Let M be a 3-connected matroid, and let N be a 3-connected minor of M. We say that a pair is N-detachable if one of the matroids or is both 3-connected and has an N-minor. This is the first in a series of three papers where we describe the structures that arise when M has no N-detachable pairs. In this paper, we prove that if no N-detachable pair can be found in M, then either M has a 3-separating set, which we call X, with certain strong structural properties, or M has one of three particular 3-separators that can appear in a matroid with no N-detachable pairs.
Citation
Brettell, N., Whittle, G., & Williams, A. (2020). N-detachable pairs in 3-connected matroids I: Unveiling X. Journal of Combinatorial Theory, Series B, 141, 295-342. https://doi.org/10.1016/j.jctb.2019.08.005
Journal Article Type | Article |
---|---|
Online Publication Date | Sep 2, 2019 |
Publication Date | Mar 31, 2020 |
Deposit Date | Sep 18, 2019 |
Publicly Available Date | Sep 2, 2020 |
Journal | Journal of Combinatorial Theory, Series B |
Print ISSN | 0095-8956 |
Publisher | Elsevier |
Peer Reviewed | Peer Reviewed |
Volume | 141 |
Pages | 295-342 |
DOI | https://doi.org/10.1016/j.jctb.2019.08.005 |
Public URL | https://durham-repository.worktribe.com/output/1291416 |
Files
Accepted Journal Article
(524 Kb)
PDF
Publisher Licence URL
http://creativecommons.org/licenses/by-nc-nd/4.0/
Copyright Statement
© 2019 This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/
You might also like
Excluded minors are almost fragile
(2020)
Journal Article
Coloring Graphs with Constraints on Connectivity
(2016)
Journal Article
Solving problems on generalized convex graphs via mim-width
(2023)
Journal Article
Steiner trees for hereditary graph classes
(2020)
Presentation / Conference Contribution
Computing Subset Vertex Covers in H-Free Graphs
(2023)
Presentation / Conference Contribution
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2025
Advanced Search