2002
DOI: 10.1006/jctb.2001.2068
|View full text |Cite
|
Sign up to set email alerts
|

Totally Free Expansions of Matroids

Abstract: The aim of this paper is to give insight into the behaviour of inequivalent representations of 3-connected matroids. An element x of a matroid M is fixed if there is no extension MOE of M by an element xOE such that {x, xOE} is independent and MOE is unaltered by swapping the labels on x and xOE. When x is fixed, a representation of M 0 x extends in at most one way to a representation of M. A 3-connected matroid N is totally free if neither N nor its dual has a fixed element whose deletion is a series extensio… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
46
0

Year Published

2005
2005
2015
2015

Publication Types

Select...
7

Relationship

2
5

Authors

Journals

citations
Cited by 28 publications
(46 citation statements)
references
References 20 publications
0
46
0
Order By: Relevance
“…In 2002, Geelen et al strengthened Seymour's Splitter Theorem [5]. One consequence of this paper is that the free spikes are building blocks for non-binary matroids that are representable over non-prime fields.…”
Section: The Free Spikesmentioning
confidence: 87%
See 1 more Smart Citation
“…In 2002, Geelen et al strengthened Seymour's Splitter Theorem [5]. One consequence of this paper is that the free spikes are building blocks for non-binary matroids that are representable over non-prime fields.…”
Section: The Free Spikesmentioning
confidence: 87%
“…The free spikes were introduced in [12] and are also found in [5,4]. The rank-k (k 3) free spike, denoted k is a matroid on the ground set {a 1 , b 1 , a 2 , b 2 , .…”
Section: The Free Spikesmentioning
confidence: 99%
“…Furthermore, if x is freer than y, but y is not freer than x, then x is strictly freer than y. The next, and last, result of these preliminaries is a combination of Proposition 4.4(i) and Proposition 4.5(iv) of [9]. Proposition 5.6.…”
Section: Stabilizersmentioning
confidence: 89%
“…Recently clones have become important in the study of matroid representability [3][4][5][6]. We show that a sufficiently connected matroid that is representable over a small field does not have a large clone set.…”
Section: Introductionmentioning
confidence: 99%
“…The terminology follows [3,4,7]. Elements e and f in a matroid M are clones if interchanging e and f and fixing all other elements is an automorphism of M. A clonal class of M is a maximal set X ⊆ E(M) such that each pair of elements of X are clones.…”
Section: Introductionmentioning
confidence: 99%