University of Cambridge > Talks.cam > Combinatorics Seminar > Graphs forced by rainbow stars

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Graphs forced by rainbow stars

Download to your calendar using vCal

  • UserPeter Wagner (Rostock)
  • ClockThursday 23 May 2024, 14:30-15:30
  • HouseMR12.

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

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:

Note that ex-directory lists are not shown.

Other lists

Online (link to be shared in email) Department of Engineering - LR2 Winstanley Lecture Theatre, Trinity College, Cambridge CB2 1TQ (Entrance via St John’s Street, opposite Trinity College’s main gate)

Other talks

Bigger Picture Talk: Developing future marine engines running on ammonia and other green fuels External Seminar - Jenn Brophy TBC Title to be confirmed Tea and Coffee Break CSAR lecture: 46&: Development of a probiotic that supports the natural removal of forever chemicals from the body Title to be confirmed
 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity