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

  Browse A-Z

Log in

Cambridge users (raven)details Other usersdetails No account?details

Information on

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

Some problems in coarse graph theory

Add to your list(s) 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 ibl10.

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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

The obesity epidemic: Discussing the global health crisis Impulse MRC Cancer Unit Seminars

Other talks

Beyond the Sensor: Participatory Socio-Ecological Mapping Reveals New for Equitable Restoration in Mosaic Landscapes of Ghana Walter Kohn: the theoretical physicist who created DFT and won the Nobel Prize for Chemistry Where Land and Waters Meet’; 10,000 years of ‘Wildscape’ human eco-dynamics and implications for sustainability and land use change Interplay between vegetation and land-atmosphere coupling Investigating the role of Influenza virus neuraminidase activity on the host immune response Role of cellular senescence in cancer and ageing: therapeutic opportunities
 

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