Title	On a local version of Reed's conjecture
Creator	Postle, Luke
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2017-08-24T16:00
Description	In 1998, Reed conjectured that the chromatic number of a graph is at most the average of its maximum degree plus one and its clique number (rounded up). As evidence for his conjecture, he proved that it is at most some non-trivial convex combination of the two. Recently, Michelle Delcourt and I proved the same is true for list chromatic number. Tom Kelly and I meanwhile conjectured that a `local' version of Reed's conjecture wherein the parameters are replaced by local parameters (list size, degree and clique number of neighborhood) and proved a non-trivial convex combination under some mild assumptions.
Extent	28 minutes
Subject	Mathematics; Combinatorics; Computer science; Discrete mathematics
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: University of Waterloo
Series	BIRS Workshop Lecture Videos (Banff, Alta)
Date Available	2018-04-12
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0365558
URI	http://hdl.handle.net/2429/65306
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