BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Katherine Staden
DTSTART;VALUE=DATE-TIME:20200722T070000Z
DTEND;VALUE=DATE-TIME:20200722T080000Z
DTSTAMP;VALUE=DATE-TIME:20240328T170119Z
UID:CMSAcomb/1
DESCRIPTION:Title: Two conjectures of Ringel\nby Katherine Staden as part of Australasia
n Combinatorics Seminar\n\n\nAbstract\nIn a graph decomposition problem\,
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 the piec
es have a comparable number of vertices\, and in particular on two conject
ures of Ringel from the 60s on decomposing the complete graph: in the firs
t (the generalised Oberwolfach problem) the pieces are 2-regular graphs\,
and in the second they are half-sized trees. I will give some ideas from m
y recent proofs of these problems for large graphs in joint work with Pete
r Keevash. The second conjecture was proved independently by Montgomery\,
Pokrovskiy and Sudakov.\n
LOCATION:https://researchseminars.org/talk/CMSAcomb/1/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Annika Heckel
DTSTART;VALUE=DATE-TIME:20200729T070000Z
DTEND;VALUE=DATE-TIME:20200729T080000Z
DTSTAMP;VALUE=DATE-TIME:20240328T170119Z
UID:CMSAcomb/2
DESCRIPTION:Title: Non-concentration of the chromatic number\nby Annika Heckel as part o
f Australasian Combinatorics Seminar\n\n\nAbstract\nThere are many impress
ive results asserting that the chromatic number of a random graph is sharp
ly concentrated. In 1987\, Shamir and Spencer showed that for any function
p=p(n)\, the chromatic number of $G(n\,p)$ takes one of at most about n1/
2 consecutive values whp. For sparse random graphs\, much sharper concentr
ation is known to hold: Alon and Krivelevich proved two point concentratio
n whenever $p< n^{1/2 - \\epsilon}$.\nHowever\, until recently no non-triv
ial lower bounds for the concentration were known for any $p$\, even thoug
h the question was raised prominently by Erdős in 1992 and Bollobás in 2
004.\nIn this talk\, we show that the chromatic number of $G(n\,1/2)$ is n
ot whp contained in any sequence of intervals of length $n^{1/2-o(1)}$\, a
lmost matching Shamir and Spencer's upper bound.\nJoint work with Oliver R
iordan.\n
LOCATION:https://researchseminars.org/talk/CMSAcomb/2/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Tuan Tran
DTSTART;VALUE=DATE-TIME:20200826T010000Z
DTEND;VALUE=DATE-TIME:20200826T020000Z
DTSTAMP;VALUE=DATE-TIME:20240328T170119Z
UID:CMSAcomb/4
DESCRIPTION:by Tuan Tran as part of Australasian Combinatorics Seminar\n\n
Abstract: TBA\n
LOCATION:https://researchseminars.org/talk/CMSAcomb/4/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Tamas Makai
DTSTART;VALUE=DATE-TIME:20200819T010000Z
DTEND;VALUE=DATE-TIME:20200819T020000Z
DTSTAMP;VALUE=DATE-TIME:20240328T170119Z
UID:CMSAcomb/5
DESCRIPTION:Title: Majority dynamics in the dense binomial random graph\nby Tamas Makai
as part of Australasian Combinatorics Seminar\n\n\nAbstract\nMajority dyna
mics is a deterministic process on a graph which evolves in the following
manner. Initially every vertex is coloured either red or blue. In each ste
p of the process every vertex adopts the colour of the majority of its nei
ghbours\, or retains its colour if no majority exists.\nWe analyse the beh
aviour of this process in the dense binomial random graph when the initial
colour of every vertex is chosen independently and uniformly at random. W
e show that with high probability the process reaches complete unanimity\,
partially proving a conjecture of Benjamini\, Chan\, O'Donnel\, Tamuz and
Tan.\nThis is joint work with N. Fountoulakis and M. Kang.\n
LOCATION:https://researchseminars.org/talk/CMSAcomb/5/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Geertrui Van de Voorde
DTSTART;VALUE=DATE-TIME:20200909T010000Z
DTEND;VALUE=DATE-TIME:20200909T020000Z
DTSTAMP;VALUE=DATE-TIME:20240328T170119Z
UID:CMSAcomb/6
DESCRIPTION:by Geertrui Van de Voorde as part of Australasian Combinatoric
s Seminar\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/CMSAcomb/6/
END:VEVENT
BEGIN:VEVENT
SUMMARY:David Conlon (Caltech)
DTSTART;VALUE=DATE-TIME:20200922T070000Z
DTEND;VALUE=DATE-TIME:20200922T080000Z
DTSTAMP;VALUE=DATE-TIME:20240328T170119Z
UID:CMSAcomb/7
DESCRIPTION:Title: The random algebraic method\nby David Conlon (Caltech) as part of Aus
tralasian Combinatorics Seminar\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/CMSAcomb/7/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Tony Huynh (Monash University)
DTSTART;VALUE=DATE-TIME:20201006T000000Z
DTEND;VALUE=DATE-TIME:20201006T010000Z
DTSTAMP;VALUE=DATE-TIME:20240328T170119Z
UID:CMSAcomb/8
DESCRIPTION:Title: Idealness of k-wise intersecting families\nby Tony Huynh (Monash Univ
ersity) as part of Australasian Combinatorics Seminar\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/CMSAcomb/8/
END:VEVENT
END:VCALENDAR