University of Birmingham > Talks@bham > Combinatorics and Probability seminar > Resilient degree sequences with respect to Hamiltonicity in random graphs

## Resilient degree sequences with respect to Hamiltonicity in random graphsAdd to your list(s) Download to your calendar using vCal - Alberto Espuny, University of Birmingham
- Thursday 13 December 2018, 15:00-16:00
- Watson LTB.
If you have a question about this talk, please contact Johannes Carmesin. The local resilience of a graph with respect to a property P can be defined as the maximum number of edges incident to each vertex that an adversary can delete without destroying P. The resilience of random graphs with respect to various properties has received much attention in recent years. We investigate a notion of local resilience in which the adversary is allowed to delete a different number of edges at each vertex, and obtain some results which improve on previous results. This is joint work with P. Condon, J. Kim, D. Kühn and D. Osthus. 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 listsMedical Imaging Research Seminars Data Science and Computational Statistics Seminar Filling in the blank – I will be ….... in 2050’## Other talksTBA TBA Harness light-matter interaction in low-dimensional materials and nanostructures: from advanced light manipulation to smart photonic devices Integral equation methods for acoustic scattering by fractals The Holographic Universe Parameter estimation for macroscopic pedestrian dynamics models using trajectory data |