<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<title></title>
</head>
<body>
<div name="messageBodySection">
<div><span style="font-family:"Times New Roman";font-size:18px;">Interesting talk! Wish I was there for it! </span></div>
</div>
<div name="messageSignatureSection"><br />
<div>Best,</div>
<div>dario</div>
</div>
<div name="messageReplySection">
<div>On Oct 7, 2025 at 06:00 -0400, <a href="mailto:settfa-request@math.cas.cz">settfa-request@math.cas.cz</a>, wrote:<br />
 </div>
<blockquote style="margin: 5px 5px; padding-left: 10px; border-left-width: thin; border-left-style: solid; border-left-color: #1abc9c;">
<div>Send Settfa mailing list submissions to<br />
settfa@math.cas.cz<br />
<br />
To subscribe or unsubscribe via the World Wide Web, visit<br />
https://list.math.cas.cz/listinfo/settfa<br />
or, via email, send a message with subject or body 'help' to<br />
settfa-request@math.cas.cz<br />
<br />
You can reach the person managing the list at<br />
settfa-owner@math.cas.cz<br />
<br />
When replying, please edit your Subject line so it is more specific<br />
than "Re: Contents of Settfa digest..."<br />
<br />
<br />
Today's Topics:<br />
<br />
1. *Tomorrow* Tuesday 7 Oct, Peter J. Cameron<br />
(David Bradley-Williams)<br />
<br />
<br />
----------------------------------------------------------------------<br />
<br />
Message: 1<br />
Date: Mon, 06 Oct 2025 15:20:36 +0200<br />
From: David Bradley-Williams <williams@math.cas.cz><br />
To: settfa@math.cas.cz<br />
Cc: Peter Cameron <pjc20@st-andrews.ac.uk><br />
Subject: [Settfa] *Tomorrow* Tuesday 7 Oct, Peter J. Cameron<br />
Message-ID: <047678359cc3415eb86c707c42f81662@math.cas.cz><br />
Content-Type: text/plain; charset=UTF-8; format=flowed<br />
<br />
Tuesday, 7 October 2025 - 10:00 to 11:30<br />
Place: IM, kon?rna<br />
<br />
Speaker: Peter J. Cameron, University of St Andrews<br />
Title: Graphs (and simplicial complexes) defined on groups<br />
<br />
Abstract<br />
<br />
My subject is graphs whose vertex set is a group and whose edges are<br />
defined in terms of the group operation, so that the graph is invariant<br />
under all automorphisms of the group. The classical example is the<br />
commuting graph of a group, defined by Brauer and Fowler in a seminal<br />
paper in 1955.<br />
<br />
There has been a lot of work on this topic recently. My interests are<br />
mainly in how the theories of groups and graphs can help one another.<br />
Some of the questions I will address are<br />
<br />
- finding new results about groups;<br />
- characterising important classes of groups using graphs;<br />
- recognising graphs obtained from groups and, if possible,<br />
reconstructing the groups;<br />
- finding some beautiful graphs.<br />
<br />
Recently I have widened the investigation to simplicial complexes<br />
defined on groups; I will present a small amount of new material and<br />
some open problems on this also.<br />
<br />
For more information see the seminar web page at<br />
https://www.math.cas.cz/index.php/events/seminar/6<br />
<br />
<br />
------------------------------<br />
<br />
_______________________________________________<br />
Settfa mailing list<br />
Settfa@math.cas.cz<br />
https://list.math.cas.cz/listinfo/settfa<br />
<br />
<br />
End of Settfa Digest, Vol 79, Issue 1<br />
*************************************<br />
 </div>
</blockquote>
</div>
</body>
</html>