CITATION STYLE
Treglown, A., & Zhao, Y. (2013). Tight minimum degree conditions forcing perfect matchings in uniform hypergraphs. In The Seventh European Conference on Combinatorics, Graph Theory and Applications (pp. 33–38). Scuola Normale Superiore. https://doi.org/10.1007/978-88-7642-475-5_6
Mendeley helps you to discover research relevant for your work.