Stefan Glock, Daniela Kühn, Deryk Osthus. Extremal aspects of graph and hypergraph decomposition problems. In Konrad K. Dabrowski, Maximilien Gadouleau, Nicholas Georgiou, Matthew Johnson 0002, George B. Mertzios, Daniël Paulusma, editors, Surveys in Combinatorics, 2021: Invited lectures from the 28th British Combinatorial Conference, Durham, UK, July 5-9, 2021. pages 235-266, Cambridge University Press, 2021. [doi]
@inproceedings{GlockKO21,
title = {Extremal aspects of graph and hypergraph decomposition problems},
author = {Stefan Glock and Daniela Kühn and Deryk Osthus},
year = {2021},
doi = {10.1017/9781009036214.007},
url = {https://doi.org/10.1017/9781009036214.007},
researchr = {https://researchr.org/publication/GlockKO21},
cites = {0},
citedby = {0},
pages = {235-266},
booktitle = {Surveys in Combinatorics, 2021: Invited lectures from the 28th British Combinatorial Conference, Durham, UK, July 5-9, 2021},
editor = {Konrad K. Dabrowski and Maximilien Gadouleau and Nicholas Georgiou and Matthew Johnson 0002 and George B. Mertzios and Daniël Paulusma},
publisher = {Cambridge University Press},
isbn = {978-1-009-03621-4},
}