1. An algorithmic hypergraph regularity lemma. Issue 2 (7th December 2017) Authors: Nagle, Brendan; Rödl, Vojtěch; Schacht, Mathias Journal: Random structures & algorithms Issue: Volume 52:Issue 2(2018) Page Start: 301 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
2. Counting results for sparse pseudorandom hypergraphs I. (October 2017) Authors: Kohayakawa, Yoshiharu; Mota, Guilherme Oliveira; Schacht, Mathias; Taraz, Anusch Journal: European journal of combinatorics Issue: Volume 65(2017) Page Start: 276 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
3. Counting results for sparse pseudorandom hypergraphs II. (October 2017) Authors: Kohayakawa, Yoshiharu; Mota, Guilherme Oliveira; Schacht, Mathias; Taraz, Anusch Journal: European journal of combinatorics Issue: Volume 65(2017) Page Start: 288 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
4. Embedding spanning subgraphs in uniformly dense and inseparable graphs. Issue 4 (24th August 2020) Authors: Ebsen, Oliver; Maesaka, Giulia S.; Reiher, Christian; Schacht, Mathias; Schülke, Bjarne Journal: Random structures & algorithms Issue: Volume 57:Issue 4(2020) Page Start: 1077 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
5. Front Cover: Pd‐Catalyzed Synthesis of γ‐Keto Esters as Key Intermediates for the Synthesis of γ‐Hydroxybutenolides (Eur. J. Org. Chem. 15/2019). Issue 15 (1st April 2019) Authors: Schacht, Mathias; Mohammadi, Djawid; Schützenmeister, Nina Journal: European journal of organic chemistry Issue: Issue 15(2019) Page Start: 2566 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
6. Hamiltonian Berge cycles in random hypergraphs. (8th March 2021) Authors: Bal, Deepak; Berkowitz, Ross; Devlin, Pat; Schacht, Mathias Journal: Combinatorics, probability and computing Issue: Volume 30:Number 2(2021) Page Start: 228 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
7. High powers of Hamiltonian cycles in randomly augmented graphs. Issue 2 (21st June 2021) Authors: Antoniuk, Sylwia; Dudek, Andrzej; Reiher, Christian; Ruciński, Andrzej; Schacht, Mathias Journal: Journal of graph theory Issue: Volume 98:Issue 2(2021) Page Start: 255 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
8. Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs. Issue 2 (12th February 2019) Authors: Reiher, Christian; Rödl, Vojtěch; Ruciński, Andrzej; Schacht, Mathias; Szemerédi, Endre Journal: Proceedings of the London Mathematical Society Issue: Volume 119:Issue 2(2019) Page Start: 409 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
9. On the local density problem for graphs of given odd‐girth. Issue 2 (20th June 2018) Authors: Bedenknecht, Wiebke; Mota, Guilherme Oliveira; Reiher, Christian; Schacht, Mathias Journal: Journal of graph theory Issue: Volume 90:Issue 2(2019) Page Start: 137 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
10. On the size-Ramsey number of grid graphs. (6th September 2021) Authors: Clemens, Dennis; Miralaei, Meysam; Reding, Damian; Schacht, Mathias; Taraz, Anusch Journal: Combinatorics, probability and computing Issue: Volume 30:Number 5(2021) Page Start: 670 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗