Rainbow spanning subgraphs of graphs with large minimum degree

Add to your list(s) Download to your calendar using vCal

• Matthew Coulson (University of Birmingham)
• Tuesday 06 February 2018, 15:00-16:00
• Physics West 106.

If you have a question about this talk, please contact Allan Lo.

If G is an edge coloured graph of order n, we say a subgraph H is rainbow if each edge of H has a different colour. Allowing the colouring of G to be arbitrary makes it easy to avoid all non-trivial rainbow spanning subgraphs. Suppose instead that the colouring is k-bounded, we ask how large k can be for certain pairings of graphs G with a spanning subgraph H. The case in which G is complete was solved by Böttcher, Kohayakawa and Procacci. We will exhibit some graphs H where taking the minimum degree of G to be slightly above H’s containment threshold allows us to find a rainbow copy of H in G for any μn-bounded colouring of G.

Joint work with Peter Keevash, Guillem Perarnau and Liana Yepremyan.

This talk is part of the Combinatorics and Probability seminar series.

This talk is included in these lists:

• Combinatorics and Probability seminar
• Physics West 106
• School of Mathematics events

Note that ex-directory lists are not shown.