Title	Holes in graphs of large chromatic number
Creator	Scott, Alex
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2017-08-21T16:38
Description	Let G be a graph with large chromatic number. What induced subgraphs must it contain? It may contain a large complete subgraph, but what can we say if this is not the case? We will survey recent work on this topic, concentrating on the question of finding induced cycles. In particular, we will discuss recent results with Paul Seymour, Maria Chudnovsky and Sophie Spirkl.
Extent	54 minutes
Subject	Mathematics; Combinatorics; Computer science; Discrete mathematics
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: University of Oxford
Series	BIRS Workshop Lecture Videos (Banff, Alta)
Date Available	2018-04-10
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0365298
URI	http://hdl.handle.net/2429/65250
Affiliation	Non UBC
Peer Review Status	Unreviewed
Scholarly Level	Faculty
Rights URI	http://creativecommons.org/licenses/by-nc-nd/4.0/
Aggregated Source Repository	DSpace

Open Collections

BIRS Workshop Lecture Videos