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

  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

Universal graphs

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

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

FERSA Kaleidoscope Conference Dr Augustus Chee

Other talks

Lecture Supper: James Stuart: Radical liberalism, ‘non-gremial students’ and continuing education Brain tumours: demographics, presentation, diagnosis, treatment Making Refuge: Flight Human Brain Development Modelled in a Dish The Most Influential Living Philosopher? Molecular mechanisms of cardiomyopathies in patients with severe non-ischemic heart failure Speculations about homological mirror symmetry for affine hypersurfaces Genomic Approaches to Cancer Investigating the Functional Anatomy of Motion Processing Pathways in the Human Brain Café Synthetique: Graduate Talks! Uncertainty Quantification of geochemical and mechanical compaction in layered sedimentary basins
 

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