Graphs forced by rainbow stars

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

• Peter Wagner (Rostock)
• Thursday 23 May 2024, 14:30-15:30
• MR12.

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

We study colourings of the edges of the complete graph K_n. For some graph H, we say that a colouring contains a rainbow H, if there is an embedding of H into K_n, such that all edges of the embedded copy have pairwise distinct colours. Only two special types of rainbow trees of small diameter are forced by a high number of vertices of high colour degree, and then only two rainbow stars suffice. Whilst the optimal colour degree is known for one type of trees, we will discuss some bounds for the other type (of larger diameter).

This talk is part of the Combinatorics Seminar series.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• Combinatorics Seminar
• DPMMS Lists
• DPMMS Pure Maths Seminar
• DPMMS info aggregator
• DPMMS lists
• Hanchen DaDaDash
• Interested Talks
• MR12
• School of Physical Sciences
• bld31

Note that ex-directory lists are not shown.