HIGHLIGHTS
- who: J. Eur., Math. Soc. and Stefan Glock, Felix Joos from the (UNIVERSITY) have published the research work: Stefan Glock · Felix Joos Jaehoon Kim Daniela K¨uhn Deryk Osthus, in the Journal: (JOURNAL)
- what: The authors show that this can be achieved for all large n. The authors provide an overview of the approach and in Section 3 the authors collect several embedding and decomposition results including the bandwidth theorem for approximate decompositions from_[12] and a special case of a result of Keevash on resolvable designs. Proof sketch For simplicity, the authors just sketch . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.