A Median-Type Condition for Graph Tiling



Komlos determined the asymptotically optimal minimum degree condition for covering a given proportion of vertices of a host graph by vertex-disjoint copies of a fixed graph H. We show that the minimum degree condition can be relaxed in the sense that we require only a given fraction of vertices to have the prescribed degree. Joint work with Diana Piguet.


Date: Sep 26, 2018 at 2018-09-26 14:30:00 h
Venue: República 701, Sala 33. (3er Piso)
Speaker: Maria Saumell
Affiliation: Czech Academy of Sciences, Czech Republic.
Coordinator: Prof. José Versache

Posted on Sep 26, 2018 in AGCO, Seminars