Title	$P_6$-free triangle-free graphs
Creator	Spirkl, Sophie
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2017-08-24T11:11
Description	I will talk about an explicit construction for triangle-free graphs that do not contain a six-vertex path as an induced subgraph. Examples include the 16-vertex Clebsch graph, and the graph that arises from a complete bipartite graph by subdividing every edge of a perfect matching exactly once. We show that every connected triangle-free graph with no six-vertex induced path can be obtained from an induced subgraph of one of these two by restricted homogeneous set and homogeneous pair operations. Joint work with Maria Chudnovsky, Paul Seymour, and Mingxian Zhong.
Extent	18 minutes
Subject	Mathematics; Combinatorics; Computer science; Discrete mathematics
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: Princeton University
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.0365556
URI	http://hdl.handle.net/2429/65304
Affiliation	Non UBC
Peer Review Status	Unreviewed
Scholarly Level	Graduate
Rights URI	http://creativecommons.org/licenses/by-nc-nd/4.0/
Aggregated Source Repository	DSpace

Open Collections

BIRS Workshop Lecture Videos