BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Forcing quasirandomness in graphs - Nikola Spasic (Cambridge)
DTSTART:20221117T143000Z
DTEND:20221117T153000Z
UID:TALK192833@talks.cam.ac.uk
CONTACT:103978
DESCRIPTION:A set of graphs is said to be forcing if their homomorphism de
 nsities determine whether a sequence of graphs is quasirandom. This defini
 tion 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 di
 scussed\, as well as a new proof of the result of Shapira and Tyomkyn that
  sets of cliques are not forcing.
LOCATION:MR12
END:VEVENT
END:VCALENDAR