University of Cambridge > > Combinatorics Seminar > Forcing quasirandomness in graphs

Forcing quasirandomness in graphs

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

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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


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