University of Cambridge > Talks.cam > Combinatorics Seminar > Induced subgraphs of graphs with large chromatic number

  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

Induced subgraphs of graphs with large chromatic number

Download to your calendar using vCal

  • UserAlex Scott (University of OXford)
  • ClockThursday 13 October 2016, 14:30-15:30
  • HouseMR12.

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

What can we say about the induced subgraphs of a graph G with very large chromatic number? If G has no large cliques, then what else can we guarantee? We will discuss recent work on this topic, and present some new results. (Joint work with Maria Chudnovsky and Paul Seymour.)

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

Audiovisual Room, Second Floor. Alison Richard Building, 7 West Road, Cambridge CB3 9DT. Lecture Theatre 1, Computer Laboratory, Williams Gates Building Webinar - link to follow after 12 noon Tuesday

Other talks

Discovery Investigations: Science, Empire and the Making of the British South Atlantic Title to be confirmed Title TBC Title to be confirmed Professor Philip Rosenstiel, W3 Professor of Clinical Molecular Biology, Director, Institute of Clinical Molecular Biology (IKMB), Kiel University Machine Politics? Computers and AI in the History of Political Thought
 

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