Bases for permutation groups and matroids

DOI10.1016/0195-6698(95)90035-7zbMath0837.05036OpenAlexW2015647608MaRDI QIDQ1902960

Dmitry G. Fon-Der-Flaass, Peter J. Cameron

Publication date: 13 May 1996

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0195-6698(95)90035-7

zbMATH Keywords

permutation groupgroup actionmatroidstabilizerflatperfect matroid designirredundant basis

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) General theory for finite permutation groups (20B05)

Related Items (10)

Uncoverings-by-bases for base-transitive permutation groups. ⋮ A classification of finite primitive IBIS groups with alternating socle ⋮ Generation of all randomizations using circuits ⋮ IBIS soluble linear groups ⋮ On the single-orbit conjecture for uncoverings-by-bases ⋮ The full automorphism groups, determining sets and resolving sets of coprime graphs ⋮ Permutation codes ⋮ One point stabilizers in almost simple sharp permutation groups ⋮ On the Saxl graph of a permutation group ⋮ Primitive permutation IBIS groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Homogeneous designs and geometric lattices
• Sharp sets of permutations
• Infinite geometric groups of rank 4
• Kennzeichnung endlicher linearer Gruppen als Permutationsgruppen
• Triply transitive groups in which only the identity fixes four letters
• On Permutation Geometries
• Minimum bases for permutation groups: The greedy approximation
• Random Permutations: Some Group-Theoretic Aspects
• Cofinitary Permutation Groups
• Combinatorial Relations and Chromatic Graphs
• On a class of doubly transitive permutation groups
• On a class of doubly transitive permutation groups

This page was built for publication: Bases for permutation groups and matroids