1. Clique-factors in sparse pseudorandom graphs. (December 2019) Authors: Han, Jie; Kohayakawa, Yoshiharu; Morris, Patrick; Person, Yury Journal: European journal of combinatorics Issue: Volume 82(2019) Page Start: Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
2. EMBEDDING SPANNING BOUNDED DEGREE GRAPHS IN RANDOMLY PERTURBED GRAPHS. Issue 2 (2nd April 2020) Authors: Böttcher, Julia; Montgomery, Richard; Parczyk, Olaf; Person, Yury Journal: Mathematika Issue: Volume 66:Issue 2(2020) Page Start: 422 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
3. Exact Results on the Number of Restricted Edge Colorings for Some Families of Linear Hypergraphs. Issue 1 (6th August 2012) Authors: Lefmann, Hanno; Person, Yury Journal: Journal of graph theory Issue: Volume 73:Issue 1(2013) Page Start: 1 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
4. Finding any given 2‐factor in sparse pseudorandom graphs efficiently. Issue 1 (5th May 2020) Authors: Han, Jie; Kohayakawa, Yoshiharu; Morris, Patrick; Person, Yury Journal: Journal of graph theory Issue: Volume 96:Issue 1(2021) Page Start: 87 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
5. Finding tight Hamilton cycles in random hypergraphs faster. (23rd March 2021) Authors: Allen, Peter; Koch, Christoph; Parczyk, Olaf; Person, Yury Journal: Combinatorics, probability and computing Issue: Volume 30:Number 2(2021) Page Start: 239 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
6. Minimum rainbow H-decompositions of graphs. (June 2018) Authors: Özkahya, Lale; Person, Yury Journal: European journal of combinatorics Issue: Volume 71(2018) Page Start: 111 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
7. Near-perfect clique-factors in sparse pseudorandom graphs. (11th July 2021) Authors: Han, Jie; Kohayakawa, Yoshiharu; Person, Yury Journal: Combinatorics, probability and computing Issue: Volume 30:Number 4(2021) Page Start: 570 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
8. Spanning structures and universality in sparse hypergraphs1. Issue 4 (11th October 2016) Authors: Parczyk, Olaf; Person, Yury Journal: Random structures & algorithms Issue: Volume 49:Issue 4(2016) Page Start: 819 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
9. Tight Hamilton cycles in random hypergraphs. Issue 3 (16th October 2013) Authors: Allen, Peter; Böttcher, Julia; Kohayakawa, Yoshiharu; Person, Yury Journal: Random structures & algorithms Issue: Volume 46:Issue 3(2015) Page Start: 446 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
10. Universality for bounded degree spanning trees in randomly perturbed graphs. Issue 4 (7th April 2019) Authors: Böttcher, Julia; Han, Jie; Kohayakawa, Yoshiharu; Montgomery, Richard; Parczyk, Olaf; Person, Yury Journal: Random structures & algorithms Issue: Volume 55:Issue 4(2019) Page Start: 854 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗