Title	Polynomial chi-boundedness
Creator	Trotignon, Nicolas
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2017-08-21T16:13
Description	A graph $G$ is $\chi$-bounded by the function $f$ if every induced subgraph $H$ of $G$ satisfied $\chi(H) \le f(\omega(H))$. A class of graphs is $\chi$-bounded if there exists a function $f$ such that every graph in the class is $\chi$-bounded by $f$. It is polynomially $\chi$-bounded if there is such a function $f$ that is a polynomial. Some classes of graphs are $\chi$-bounded, some are not. It is not known whether there exists a hereditary class of graph that is $\chi$-bounded but not polynomially $\chi$-bounded. The goal of this talk is to survey several results, proof techniques, and open questions around the notion of polynomial $\chi$-boundedness.
Extent	23 minutes
Subject	Mathematics; Combinatorics; Computer science; Discrete mathematics
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: CNRS - École Normale Supérieure de Lyon
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.0365559
URI	http://hdl.handle.net/2429/65307
Affiliation	Non UBC
Peer Review Status	Unreviewed
Scholarly Level	Other
Rights URI	http://creativecommons.org/licenses/by-nc-nd/4.0/
Aggregated Source Repository	DSpace

Open Collections

BIRS Workshop Lecture Videos