Forcing quasirandomness in graphs

Add to your list(s) Download to your calendar using vCal

• Nikola Spasic (Cambridge)
• Thursday 17 November 2022, 14:30-15:30
• MR12.

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.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• Combinatorics Seminar
• DPMMS Lists
• DPMMS Pure Maths Seminar
• DPMMS info aggregator
• DPMMS lists
• Hanchen DaDaDash
• Interested Talks
• MR12
• School of Physical Sciences
• bld31

Note that ex-directory lists are not shown.