Fixing numbers for matroids

DOI10.1007/S00373-015-1540-7zbMATH Open1332.05029arXiv1307.7460OpenAlexW2036668118MaRDI QIDQ5964981FDOQ5964981

Jennifer McNulty, Gary Gordon, Nancy Ann Neudauer

Publication date: 2 March 2016

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Abstract: Motivated by work in graph theory, we define the fixing number for a matroid. We give upper and lower 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). We prove the fixing numbers for the cycle matroid and bicircular matroid associated with 3-connected graphs are identical. Many of these results have interpretations through permutation groups, and we make this connection explicit.

Full work available at URL: https://arxiv.org/abs/1307.7460

zbMATH Keywords

automorphismpermutation groupfixing numberbicircular matroidgraphic matroidtransversal matroidcycle matroidclones

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial aspects of matroids and geometric lattices (05B35) Permutation groups (20B99)

Cites Work

• Symmetry breaking in graphs
• Base size, metric dimension and other invariants of groups and graphs
• Destroying automorphisms by fixing nodes
• BICIRCULAR MATROIDS
• Identifying graph automorphisms using determining sets
• Matroids. A geometric introduction
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (3)

• On the fixing sets of dihedral groups
• Title not available (Why is that?)
• Fixing numbers of graphs with symmetric and generalized quaternion symmetry groups

This page was built for publication: Fixing numbers for matroids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5964981)