University of Birmingham > Talks@bham > Combinatorics and Probability seminar > Distinct degrees in induced subgraphs

## Distinct degrees in induced subgraphsAdd to your list(s) Download to your calendar using vCal - Eoin Long (University of Birmingham)
- Thursday 12 December 2019, 14:00-15:00
- Watson LTB.
If you have a question about this talk, please contact Eoin Long. An important theme of recent research in Ramsey theory has been establishing pseudorandomness properties of Ramsey graphs. An N-vertex graph is called We also show that any N-vertex graph with N > (k−1)(n−1) and n=Ω(k Joint work with Matthew Jenssen, Peter Keevash and Liana Yepremyan. 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 Bravo Cold atoms## Other talksProofs of Turán's theorem The tragic destiny of Mileva Marić Einstein Life : it’s out there, but what and why ? TBA TBA TBA |