University of Cambridge > Talks.cam > Combinatorics Seminar > Some problems in coarse graph theory

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Some problems in coarse graph theory

Download to your calendar using vCal

  • UserAlexander Scott (Oxford)
  • ClockThursday 20 February 2025, 14:30-15:30
  • HouseMR12.

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

Coarse graph theory is a developing area, which focuses on the large-scale geometric structure of graphs, particularly through the lens of quasi-isometry. A central goal here is to find coarse analogues of classical graph-theoretic results. We discuss some initial steps in this direction. Joint work with Tung Nguyen and Paul Seymour.

This talk is part of the Combinatorics Seminar series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Zoom (Meeting ID 945 3662 6774, passcode 086714) Cambridge Science Festival Saturday, 30th of November 2013, 15:00 hrs – 17:00 hrs. Seminar Room, Department of Sociology (First Floor). Free School Lane, New Museum Site University of Cambridge

Other talks

Group Presentation 1 Title to be confirmed Morning Break / Group Photo Online Causal Inference Seminar Title to be confirmed Title to follow
 

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