University of Cambridge > Talks.cam > Combinatorics Seminar > Forcing quasirandomness in graphs

  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

Forcing quasirandomness in graphs

Download to your calendar using vCal

  • UserNikola Spasic (Cambridge)
  • ClockThursday 17 November 2022, 14:30-15:30
  • HouseMR12.

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

A set of graphs is said to be forcing if their homomorphism densities determine whether a sequence of graphs is quasirandom. This definition was introduced in 1989 by Chung, Graham and Wilson, who showed that the set consisting of an edge and a cycle with four vertices is forcing. The existence of forcing sets of graphs with no forcing subsets will be discussed, as well as a new proof of the result of Shapira and Tyomkyn that sets of cliques are not forcing.

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

Multi-Faith Chaplaincy Centre, Merton Hall Farmhouse MR 11 Meeting Rooms 1&2, MRC Epidemiology Unit, Level 3, Institute of Metabolic Science, Cambridge Biomedical Campus, Cambridge CB2 0QQ

Other talks

John Kendrew Lecture - Title TBC Overview of treatment for non-small cell lung cancer Group Work CSAR lecture: In a post-Ozempic world, have we cured obesity? Market Failure, Organ Shortage, Pandemic and Climate Change: The Architecture of Cooperation Secrets of the Surface: The Mathematical Vision of Maryam Mirzakhani ( EDI Film Screening)
 

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