University of Cambridge > Talks.cam > Combinatorics Seminar > Complete Graphs with No Rainbow Tree

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

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

ℹī¸ Information

Complete Graphs with No Rainbow Tree

Download to your calendar using vCal

  • UserPeter Wagner (University of Rostock)
  • ClockThursday 24 May 2018, 14:30-15:30
  • HouseMR13.

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

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. The main emphasis of the talk is a classification of those forbidden rainbow graphs that force a low number of vertices of a high colour degree, along with some specifications and more general information in certain cases. Those graphs turn out to be of two special types of trees of small 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

Webinar & FW11, Computer Laboratory, William Gates Building. Both in person at Gurdon Institute and Online LT 1

Other talks

Title to be confirmed LMB Seminar - Mechanisms of mRNA packaging and export Dwarf Galaxies in the Local Universe Rothschild Public Lecture: The Quantum Centenary: from Order to Chaos Argentina 2005 Title to be confirmed
 

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