Corpus ID: 229678835

On Valency Problems of Saxl Graphs

@inproceedings{Chen2020OnVP,
  title={On Valency Problems of Saxl Graphs},
  author={Jiyong Chen and Hongdi Huang},
  year={2020}
}
Abstract. Let G be a permutation group on a set Ω and recall that a base for G is a subset of Ω such that its pointwise stabiliser is trivial. In a recent paper, Burness and Giudici introduced the Saxl graph of G, denoted ΣpGq, with vertex set Ω and two vertices adjacent if they form a base. If G is transitive, then ΣpGq is vertex-transitive and it is natural to consider its valency (which we refer to as the valency of G). In this paper we present a general method for computing the valency of… Expand

Tables from this paper

On the Saxl graphs of primitive groups with soluble stabilisers

References

SHOWING 1-10 OF 33 REFERENCES
On the Saxl graph of a permutation group
On base sizes for actions of finite classical groups
Base sizes for simple groups and a conjecture of Cameron
On base sizes for symmetric groups
On base sizes for almost simple primitive groups
Combinatorics - The Rota Way
...
1
2
3
4
...