University of Birmingham > Talks@bham > Combinatorics and Probability Seminar > Degree versions of some classical results in Extremal Combinatorics

## Degree versions of some classical results in Extremal CombinatoricsAdd to your list(s) Download to your calendar using vCal - Hao Huang (Emory University)
- Monday 15 May 2017, 15:00-16:00
- LTC Watson.
If you have a question about this talk, please contact Dr Andrew Treglown. In this talk, I will prove a degree version of the celebrated Erdos-Ko-Rado theorem: given n>2k, for every intersecting k-uniform hypergraph H on n vertices, there exists a vertex that lies on at most $\binom{n-2}{k-2}$ edges. A degree version of the Hilton-Milner theorem was also proved for sufficiently large n. The talk is based on joint works with Peter Frankl, Jie Han and Yi Zhao. This talk is part of the Combinatorics and Probability Seminar series. ## This talk is included in these lists:Note that ex-directory lists are not shown. |
## Other listsType the title of a new list here Computer Security Seminars BritGrav 15## Other talksMachine Learning with Causal Structure Property Relationship (CSPR): Solubility Prediction in Organic Solvents and Water An attack on ECDSA using lattice techniques Verification of Byzantine Fault Tolerant Systems RSC S F Boys-A Rahman Award Lecture Emergent behaviour in perovskites from symmetry breaking Weak universalities for some singular stochastic PDEs |