University of Cambridge > Talks.cam > Junior Algebra and Number Theory seminar > Universal graphs

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

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

ℹ️ Information

Universal graphs

Download to your calendar using vCal

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

A countable graph G is called “universal” for a property P if G contains any countable graph H in P as a subgraph. The most remarkable example of a universal graph is the Rado graph, also known as the “infinite random graph”. In general the universal graph need not always exist, so the natural question to ask is, for which properties one can find such a graph. I’m going to discuss recent results, which settle this question for a property of not containing a given finite subtree.

This talk is part of the Junior Algebra and Number Theory seminar series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

imaging Room FW11, Computer Laboratory, William Gates Building Zoom Link: https://cl-cam-ac-uk.zoom.us/j/4361570789?pwd=Nkl2T3ZLaTZwRm05bzRTOUUxY3Q4QT09&from=addon Average on weekdays: 8837.13414634 kWh

Other talks

Organiser's Welcome Topic Film, TV shows for Medical Education, ‘The Wire’ as a case study Title to be confirmed C2D3 Computational Biology Annual Symposium 2026 Afternoon Break Title to be confirmed
 

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