University of Birmingham > Talks@bham > Combinatorics and Probability Seminar > Covering and tiling hypergraphs with tight cycles

## Covering and tiling hypergraphs with tight cyclesAdd to your list(s) Download to your calendar using vCal - Nicolás Sanhueza-Matamala (Birmingham)
- Thursday 23 March 2017, 15:00-16:00
- Sandbox (Watson).
If you have a question about this talk, please contact Dr Andrew Treglown. Given an hypergraph F, a perfect F-tiling in a hypergraph H is a spanning collection of disjoint copies of F. A related notion is that of an F-covering, 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 determining the least value of the minimum degree in a graph 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 uniform hypergraphs, where determining these thresholds is an active field of research. In this talk I will review some of the known results for hypergraphs and present some new results in the case where F is a tight cycle, which is a natural generalization of cycles for uniform hypergraphs. Joint work with Jie Han and Allan Lo. This talk is part of the Combinatorics and Probability Seminar series. ## This talk is included in these lists:Note that ex-directory lists are not shown. |
## Other listsEPS - College Research Teas Cargo Featured lists## Other talkstbc Polynomial Schur's theorem Exploring the Galaxy exploiting compact objects with Gaia and LISA Exploring higher-dimensional topological physics with photons TBC Quantum Interference effects in molecular systems |