BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.bham.ac.uk//v3//EN
BEGIN:VEVENT
CATEGORIES:Combinatorics and Probability Seminar
SUMMARY:Covering and tiling hypergraphs with tight cycles
- Nicolás Sanhueza-Matamala (Birmingham)
DTSTART:20170323T150000Z
DTEND:20170323T160000Z
UID:TALK2360AT
URL:/talk/index/2360
DESCRIPTION:Given an hypergraph F\, a perfect F-tiling in a hy
pergraph H is a spanning collection of disjoint co
pies of F. A related notion is that of an F-coveri
ng\, where we cover every vertex of the host graph
H with copies of F\, but we no longer insist that
the copies are disjoint. The problem of determini
ng the least value of the minimum degree in a grap
h that ensures the existence of a perfect F-tiling
(or F-covering) is well understood in the case of
graphs. The situation is different for general un
iform hypergraphs\, where determining these thresh
olds is an active field of research. In this talk
I will review some of the known results for hyperg
raphs and present some new results in the case whe
re F is a tight cycle\, which is a natural general
ization of cycles for uniform hypergraphs. Joint w
ork with Jie Han and Allan Lo.
LOCATION:Sandbox (Watson)
CONTACT:Dr Andrew Treglown
END:VEVENT
END:VCALENDAR