On matroids of branch-width three. (Q1850629): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(8 intermediate revisions by 6 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1006/jctb.2002.2120 / rank | |||
Property / author | |||
Property / author: James G. Oxley / rank | |||
Property / author | |||
Property / author: Geoffrey P. Whittle / rank | |||
Property / author | |||
Property / author: James G. Oxley / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Geoffrey P. Whittle / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q30054572 / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1006/jctb.2002.2120 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1987279762 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A simple theorem on 3-connectivity / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Matroid 4-connectivity: A deletion-contraction theorem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Branch-width and well-quasi-ordering in matroids and graphs. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Branch-width and Rota's conjecture / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A chain theorem for 4-connected matroids / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3135082 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the structure of 3-connected matroids and graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4352948 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graph minors. X: Obstructions to tree-decomposition / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Connectivity in Matroids / rank | |||
Normal rank | |||
Property / DBLP publication ID | |||
Property / DBLP publication ID: journals/jct/HallOSW02 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1006/JCTB.2002.2120 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 10:29, 16 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On matroids of branch-width three. |
scientific article |
Statements
On matroids of branch-width three. (English)
0 references
10 December 2002
0 references
Gian-Carlo Rota conjectured that the set of excluded minors for the class of matroids (combinatorial geometries) that are representable over a fixed finite field is finite [Actes Congr. internat. Math. 1970, 3, 229--233 (1971; Zbl 0362.05044)]. Some partial results are known. For all positive integers \(k\), the class \(\mathcal{B}_k\) of matroids of branch-width at most \(k\) is minor-closed. The first interesting class is \(\mathcal{B}_3\), containing infinite antichains of matroids and is thus not well-quasi-ordered under the minor order. In this paper the authors prove Rota'conjecture for \(\mathcal{B}_3\) (in the cases \(\mathcal{B}_1\) and \(\mathcal{B}_2\) the conjecture is trivial).
0 references
matroid
0 references
minors
0 references
Rota conjecture
0 references