Graphs of maximal complexity

The Graphs and Networks seminar will meet Mondays at 9:30 am via Microsoft Teams.
Greg Constantine will start by giving 3 talks on classification attempts of graphs of maximal complexity. The triangle-free strongly regular graphs -- all subgraphs of the Higman-Sims graph -- are proved to be instances of such graphs of maximal complexity. A series of conjectures and some stubborn research issues will be brought to attention.

Jon Rubin will then give several talks on networks. Sevak Mkrtchyan will also present a series of talks.
If interested in attending, please email

Monday, October 10, 2022 - 09:30
Speaker Information
Gregory Constantine
University of Pittsburgh