BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Katherine Staden
DTSTART:20200722T070000Z
DTEND:20200722T080000Z
DTSTAMP:20260404T095119Z
UID:CMSAcomb/1
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/CMSAc
 omb/1/">Two conjectures of Ringel</a>\nby Katherine Staden as part of Aust
 ralasian Combinatorics Seminar\n\n\nAbstract\nIn a graph decomposition pro
 blem\, the goal is to partition the edge set of a host graph into a given 
 set of pieces. I will focus on the setting where both the host graph and t
 he pieces have a comparable number of vertices\, and in particular on two 
 conjectures of Ringel from the 60s on decomposing the complete graph: in t
 he first (the generalised Oberwolfach problem) the pieces are 2-regular gr
 aphs\, and in the second they are half-sized trees. I will give some ideas
  from my recent proofs of these problems for large graphs in joint work wi
 th Peter Keevash. The second conjecture was proved independently by Montgo
 mery\, Pokrovskiy and Sudakov.\n
LOCATION:https://stable.researchseminars.org/talk/CMSAcomb/1/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Annika Heckel
DTSTART:20200729T070000Z
DTEND:20200729T080000Z
DTSTAMP:20260404T095119Z
UID:CMSAcomb/2
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/CMSAc
 omb/2/">Non-concentration of the chromatic number</a>\nby Annika Heckel as
  part of Australasian Combinatorics Seminar\n\n\nAbstract\nThere are many 
 impressive results asserting that the chromatic number of a random graph i
 s sharply concentrated. In 1987\, Shamir and Spencer showed that for any f
 unction p=p(n)\, the chromatic number of $G(n\,p)$ takes one of at most ab
 out n1/2 consecutive values whp. For sparse random graphs\, much sharper c
 oncentration is known to hold: Alon and Krivelevich proved two point conce
 ntration whenever $p< n^{1/2 - \\epsilon}$.\nHowever\, until recently no n
 on-trivial lower bounds for the concentration were known for any $p$\, eve
 n though the question was raised prominently by Erdős in 1992 and Bollob
 ás in 2004.\nIn this talk\, we show that the chromatic number of $G(n\,1/
 2)$ is not whp contained in any sequence of intervals of length $n^{1/2-o(
 1)}$\, almost matching Shamir and Spencer's upper bound.\nJoint work with 
 Oliver Riordan.\n
LOCATION:https://stable.researchseminars.org/talk/CMSAcomb/2/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Tuan Tran
DTSTART:20200826T010000Z
DTEND:20200826T020000Z
DTSTAMP:20260404T095119Z
UID:CMSAcomb/4
DESCRIPTION:by Tuan Tran as part of Australasian Combinatorics Seminar\n\n
 Abstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/CMSAcomb/4/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Tamas Makai
DTSTART:20200819T010000Z
DTEND:20200819T020000Z
DTSTAMP:20260404T095119Z
UID:CMSAcomb/5
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/CMSAc
 omb/5/">Majority dynamics in the dense binomial random graph</a>\nby Tamas
  Makai as part of Australasian Combinatorics Seminar\n\n\nAbstract\nMajori
 ty dynamics is a deterministic process on a graph which evolves in the fol
 lowing manner. Initially every vertex is coloured either red or blue. In e
 ach step of the process every vertex adopts the colour of the majority of 
 its neighbours\, or retains its colour if no majority exists.\nWe analyse 
 the behaviour of this process in the dense binomial random graph when the 
 initial colour of every vertex is chosen independently and uniformly at ra
 ndom. We show that with high probability the process reaches complete unan
 imity\, partially proving a conjecture of Benjamini\, Chan\, O'Donnel\, Ta
 muz and Tan.\nThis is joint work with N. Fountoulakis and M. Kang.\n
LOCATION:https://stable.researchseminars.org/talk/CMSAcomb/5/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Geertrui Van de Voorde
DTSTART:20200909T010000Z
DTEND:20200909T020000Z
DTSTAMP:20260404T095119Z
UID:CMSAcomb/6
DESCRIPTION:by Geertrui Van de Voorde as part of Australasian Combinatoric
 s Seminar\n\nAbstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/CMSAcomb/6/
END:VEVENT
BEGIN:VEVENT
SUMMARY:David Conlon (Caltech)
DTSTART:20200922T070000Z
DTEND:20200922T080000Z
DTSTAMP:20260404T095119Z
UID:CMSAcomb/7
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/CMSAc
 omb/7/">The random algebraic method</a>\nby David Conlon (Caltech) as part
  of Australasian Combinatorics Seminar\n\nAbstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/CMSAcomb/7/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Tony Huynh (Monash University)
DTSTART:20201006T000000Z
DTEND:20201006T010000Z
DTSTAMP:20260404T095119Z
UID:CMSAcomb/8
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/CMSAc
 omb/8/">Idealness of k-wise intersecting families</a>\nby Tony Huynh (Mona
 sh University) as part of Australasian Combinatorics Seminar\n\nAbstract: 
 TBA\n
LOCATION:https://stable.researchseminars.org/talk/CMSAcomb/8/
END:VEVENT
END:VCALENDAR