BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.bham.ac.uk//v3//EN
BEGIN:VEVENT
CATEGORIES:Combinatorics and Probability Seminar
SUMMARY:Degree versions of some classical results in Extre
mal Combinatorics - Hao Huang (Emory University)
DTSTART:20170515T140000Z
DTEND:20170515T150000Z
UID:TALK2665AT
URL:/talk/index/2665
DESCRIPTION:In this talk\, I will prove a degree version of th
e celebrated Erdos-Ko-Rado theorem: given n>2k\, f
or every intersecting k-uniform hypergraph H on n
vertices\, there exists a vertex that lies on at m
ost $\\binom{n-2}{k-2}$ edges. A degree version of
the Hilton-Milner theorem was also proved for suf
ficiently large n.\n\nThe talk is based on joint w
orks with Peter Frankl\, Jie Han and Yi Zhao. \n
LOCATION:LTC Watson
CONTACT:Dr Andrew Treglown
END:VEVENT
END:VCALENDAR