Fixing numbers for matroids (Q5964981): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2036668118 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1307.7460 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Symmetry breaking in graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Base size, metric dimension and other invariants of groups and graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Identifying graph automorphisms using determining sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3767358 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5747367 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Destroying automorphisms by fixing nodes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2914102 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: BICIRCULAR MATROIDS / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5390304 / rank | |||
Normal rank |
Latest revision as of 13:11, 11 July 2024
scientific article; zbMATH DE number 6548079
Language | Label | Description | Also known as |
---|---|---|---|
English | Fixing numbers for matroids |
scientific article; zbMATH DE number 6548079 |
Statements
Fixing numbers for matroids (English)
0 references
2 March 2016
0 references
A matroid automorphism is a bijection of the ground set which preserves the circuits and a set of elements \(S\) of a matroid is called a fixing set if the only isomorphism that fixes \(S\) pointwise is the identity. The fixing number of a matroid is defined as the minimum size of a fixing set. In this paper lower and upper bounds for fixing numbers for a general matroid in terms of the size and maximum orbit size (under the action of the matroid automorphism group) are given. It is also shown that the fixing numbers for the cycle matroid and the bicircular matroid associated with 3-connected graphs with at least 5 vertices are identical. If \(1\leq m<n\) then the fixing numbers for the cycle matroid and the bicircular matroid of \(K_{m,n}\) are equal to \(n-1\). If \(m=n\) these numbers are equal to \(n\) for \(n>2\) and to 3 for \(n=2\). Many of these results have interpretations through permutation groups.
0 references
graphic matroid
0 references
fixing number
0 references
cycle matroid
0 references
bicircular matroid
0 references
automorphism
0 references
permutation group
0 references
clones
0 references
transversal matroid
0 references