University of Cambridge > > Combinatorics Seminar > Infinitely Edge-Connected Graphs

Infinitely Edge-Connected Graphs

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

  • UserJan Kurkofka (Birmingham)
  • ClockThursday 18 November 2021, 14:30-15:30
  • HouseMR12.

If you have a question about this talk, please contact HoD Secretary, DPMMS.

The Farey graph plays a role in a number of mathematical fields ranging from group theory and number theory to geometry and dynamics. Curiously, graph theory is not among these. We show that the Farey graph plays a central role in graph theory too: it is one of two infinitely edge-connected graphs that must occur as a minor in every infinitely edge-connected graph. Previously it was not known that there was any set of graphs determining infinite edge-connectivity by forming a minor-minimal list in this way, let alone a finite set.

This talk is part of the Combinatorics Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


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