![]() |
![]() |
University of Birmingham > Talks@bham > Combinatorics and Probability seminar > Intersecting families
![]() Intersecting familiesAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Guillem Perarnau. In the talk we will discuss some classical and new results on intersecting families of k-element subsets of an n-element set. We will present a new proof of the Erdos-Ko-Rado and Hilton-Milner theorems using regular bipartite graphs. Then we will show how this method may be used to prove some general structural results on intersecting families. 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 listsTest Dinner Table Terrorism - Achieving Food Security Type the title of a new list hereOther talksTBA TBA TBA TBC TBA Ultrafast Spectroscopy and Microscopy as probes of Energy Materials |