![]() |
![]() |
University of Birmingham > Talks@bham > Combinatorics and Probability seminar > Sufficient Conditions for Perfect Mixed Tilings
Sufficient Conditions for Perfect Mixed TilingsAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Eoin Long. We develop a method to study sufficient conditions for perfect mixed tilings. Our framework allows the embedding of bounded degree graphs H with components of sublinear order. As a corollary, we recover and extend the work of Kühn and Osthus regarding sufficient minimum degree conditions for perfect F-tilings (for an arbitrary fixed graph F) by replacing the F-tiling with the aforementioned graphs H. Moreover, we obtain analogous results for degree sequences and in the setting of uniformly dense graphs. Finally, we asymptotically resolve a conjecture of Komlós in a strong sense. 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 listsMaterialWell School of Metallurgy and Materials Colloquia Particle Physics SeminarsOther talksThe tragic destiny of Mileva Marić Einstein TBC Counting cycles in planar graphs TBA An introduction to τ-exceptional sequences TBA |