Title	Hypergraph $F$-designs exist for arbitrary $F$
Creator	Osthus, Deryk
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2017-08-22T16:47
Description	We show that given any $r$-uniform hypergraph $F$, the trivially necessary divisibility conditions are sufficient to guarantee a decomposition of any sufficiently large complete $r$-uniform hypergraph into edge-disjoint copies of $F$. The case when $F$ is complete corresponds to the existence of block designs, a problem going back to the 19th century, which was recently settled by Keevash. In particular, our argument provides a new proof of this result, which employs purely probabilistic and combinatorial methods. We also obtain several further generalizations. (Joint work with Stefan Glock, Daniela Kuhn and Allan Lo.)
Extent	44 minutes
Subject	Mathematics; Combinatorics; Computer science; Discrete mathematics
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: Birmingham University
Series	BIRS Workshop Lecture Videos (Banff, Alta)
Date Available	2018-04-11
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0365324
URI	http://hdl.handle.net/2429/65262
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