University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > The soluble graph of a finite group

The soluble graph of a finite group

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact nobody.

GRA2 - Groups, representations and applications: new perspectives

Let G be a finite insoluble group with soluble radical R(G). The vertices of the soluble graph of G, denoted Gamma_S(G), are labelled by the elements in G\R(G), with x and y adjacent if they generate a soluble subgroup of G. This is a natural generalisation of the widely studied commuting graph of G.   In this talk I will report on joint work with Andrea Lucchini and Daniele Nemmi, which establishes several new results on Gamma_S(G). Our main theorem states that this graph is always connected, with diameter at most 5. We can construct examples with diameter 4, so our upper bound on the diameter is close to best possible. I will explain some of the main ideas and I will present a number of open problems.

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2022 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity