University of Birmingham > Talks@bham > Combinatorics and Probability Seminar > Rainbow spanning subgraphs of graphs with large minimum degree

Rainbow spanning subgraphs of graphs with large minimum degree

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

  • UserMatthew Coulson (University of Birmingham)
  • ClockTuesday 06 February 2018, 15:00-16:00
  • HousePhysics 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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on talks.cam from the University of Cambridge.