Ramsey Properties of Randomly Perturbed Hypergraphs - Elad Aigner-Horev; Dan Hefetz; Mathias Schacht (Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2024, August 28-30, 2024, London School of Economics, London, UK, 2024)

Canonical colourings in random graphs - Nina Kamcev; Mathias Schacht (Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, LAGOS 2023, Huatulco, Mexico, September 18-22, 2023, 2023)

Localized Codegree Conditions for Tight Hamilton Cycles in 3-Uniform Hypergraphs - Pedro Araújo; Simón Piga; Mathias Schacht (SIAM J. Discret. Math., 2022)

Hamiltonian Berge cycles in random hypergraphs - Deepak Bal; Ross Berkowitz; Pat Devlin; Mathias Schacht (Comb. Probab. Comput., 2021)

Finding tight Hamilton cycles in random hypergraphs faster - Deepak Bal; Ross Berkowitz; Pat Devlin; Mathias Schacht (Comb. Probab. Comput., 2021)

On the size-Ramsey number of grid graphs - Dennis Clemens; Meysam Miralaei; Damian Reding; Mathias Schacht; Anusch Taraz (Comb. Probab. Comput., 2021)

Ramsey-type numbers involving graphs and hypergraphs with large girth - Hiêp Hàn; Troy Retter; Vojtech Rödl; Mathias Schacht (Comb. Probab. Comput., 2021)

High powers of Hamiltonian cycles in randomly augmented graphs - Sylwia Antoniuk; Andrzej Dudek; Christian Reiher; Andrzej Rucinski; Mathias Schacht (J. Graph Theory, 2021)

Turán density of cliques of order five in 3-uniform hypergraphs with quasirandom links - Sören Berger; Simón Piga; Christian Reiher; Vojtech Rödl; Mathias Schacht (Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, LAGOS 2021, Online Event / São Paulo, Brazil, May 2021, 2021)

Homomorphism Thresholds for Odd Cycles - Oliver Ebsen; Mathias Schacht (Comb., 2020)

On the structure of Dense graphs with bounded clique number - Heiner Oberkampf; Mathias Schacht (Comb. Probab. Comput., 2020)

Powers of Hamiltonian cycles in randomly augmented graphs - Andrzej Dudek; Christian Reiher; Andrzej Rucinski; Mathias Schacht (Random Struct. Algorithms, 2020)

Sharp thresholds for nonlinear Hamiltonian cycles in hypergraphs - Bhargav P. Narayanan; Mathias Schacht (Random Struct. Algorithms, 2020)

Embedding spanning subgraphs in uniformly dense and inseparable graphs - Oliver Ebsen; Giulia S. Maesaka; Christian Reiher; Mathias Schacht; Bjarne Schülke (Random Struct. Algorithms, 2020)

On the local density problem for graphs of given odd-girth - Wiebke Bedenknecht; Guilherme Oliveira Mota; Christian Reiher; Mathias Schacht (J. Graph Theory, 2019)

Loose Hamiltonian cycles forced by large (k-2)-degree - sharp version - Josefran de Oliveira Bastos; Guilherme Oliveira Mota; Mathias Schacht; Jakob Schnitzer; Fabian Schulenburg (Contributions Discret. Math., 2018)

Quasirandomness in Hypergraphs - Elad Aigner-Horev; David Conlon; Hiêp Hàn; Yury Person; Mathias Schacht (Electron. J. Comb., 2018)

Hypergraphs with vanishing Turán density in uniformly dense hypergraphs - Christian Reiher; Vojtech Rödl; Mathias Schacht (J. Lond. Math. Soc., 2018)

Sharp thresholds for Ramsey properties of strictly balanced nearly bipartite graphs - Mathias Schacht; Fabian Schulenburg (Random Struct. Algorithms, 2018)

An algorithmic hypergraph regularity lemma - Brendan Nagle; Vojtech Rödl; Mathias Schacht (Random Struct. Algorithms, 2018)

An exponential-type upper bound for Folkman numbers - Vojtech Rödl; Andrzej Rucinski; Mathias Schacht (Comb., 2017)

Ramsey properties of random graphs and Folkman numbers - Vojtech Rödl; Andrzej Rucinski; Mathias Schacht (Discuss. Math. Graph Theory, 2017)

Counting results for sparse pseudorandom hypergraphs I - Yoshiharu Kohayakawa; Guilherme Oliveira Mota; Mathias Schacht; Anusch Taraz (Eur. J. Comb., 2017)

Counting results for sparse pseudorandom hypergraphs II - Yoshiharu Kohayakawa; Guilherme Oliveira Mota; Mathias Schacht; Anusch Taraz (Eur. J. Comb., 2017)

Quasirandomness in hypergraphs - Elad Aigner-Horev; David Conlon; Hiêp Hàn; Yury Person; Mathias Schacht (Electron. Notes Discret. Math., 2017)

Loose Hamiltonian cycles forced by large (k - 2)-degree - sharp version - Josefran de Oliveira Bastos; Guilherme Oliveira Mota; Mathias Schacht; Jakob Schnitzer; Fabian Schulenburg (Electron. Notes Discret. Math., 2017)

Monochromatic trees in random graphs - Yoshiharu Kohayakawa; Guilherme Oliveira Mota; Mathias Schacht (Electron. Notes Discret. Math., 2017)

On the local density problem for graphs of given odd-girth - Wiebke Bedenknecht; Guilherme Oliveira Mota; Christian Reiher; Mathias Schacht (Electron. Notes Discret. Math., 2017)

Loose Hamiltonian Cycles Forced by Large (k-2)-Degree - Approximate Version - Josefran de Oliveira Bastos; Guilherme Oliveira Mota; Mathias Schacht; Jakob Schnitzer; Fabian Schulenburg (SIAM J. Discret. Math., 2017)

Loose Hamiltonian cycles forced by (k - 2)-degree - approximate version - Josefran de Oliveira Bastos; Guilherme Oliveira Mota; Mathias Schacht; Jakob Schnitzer; Fabian Schulenburg (Electron. Notes Discret. Math., 2016)

Packing minor-closed families of graphs into complete graphs - Silvia Messuti; Vojtech Rödl; Mathias Schacht (J. Comb. Theory B, 2016)

Embedding tetrahedra into quasirandom hypergraphs - Christian Reiher; Vojtech Rödl; Mathias Schacht (J. Comb. Theory B, 2016)

An Algorithmic Hypergraph Regularity Lemma - Brendan Nagle; Vojtech Rödl; Mathias Schacht (Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016, 2016)

Ramsey numbers for bipartite graphs with small bandwidth - Guilherme Oliveira Mota; Gábor N. Sárközy; Mathias Schacht; Anusch Taraz (Eur. J. Comb., 2015)

Packing minor closed families of graphs - Silvia Messuti; Vojtech Rödl; Mathias Schacht (Electron. Notes Discret. Math., 2015)

A counting lemma for sparse pseudorandom hypergraphs - Yoshiharu Kohayakawa; Guilherme Oliveira Mota; Mathias Schacht; Anusch Taraz (Electron. Notes Discret. Math., 2015)

Ramsey-type numbers involving graphs and hypergraphs with large girth - Hiêp Hàn; Troy Retter; Vojtech Rödl; Mathias Schacht (Electron. Notes Discret. Math., 2015)

On the Structure of Graphs with Given Odd Girth and Large Minimum Degree - Silvia Messuti; Mathias Schacht (J. Graph Theory, 2015)

Extremal results for odd cycles in sparse pseudorandom graphs - Elad Aigner-Horev; Hiêp Hàn; Mathias Schacht (Comb., 2014)

Upper bounds on probability thresholds for asymmetric Ramsey properties - Yoshiharu Kohayakawa; Mathias Schacht; Reto Spöhel (Random Struct. Algorithms, 2014)

Extremal results for odd cycles in sparse pseudorandom graphs - Elad Aigner-Horev; Hiêp Hàn; Mathias Schacht (Electron. Notes Discret. Math., 2013)

Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs - Enno Buß; Hiêp Hàn; Mathias Schacht (J. Comb. Theory B, 2013)

On Even-Degree Subgraphs of Linear Hypergraphs - Domingos Dellamonica Jr.; Penny E. Haxell; Tomasz Luczak; Dhruv Mubayi; Brendan Nagle; Yury Person; Vojtech Rödl; Mathias Schacht; Jacques Verstraëte (Comb. Probab. Comput., 2012)

Weak quasi-randomness for uniform hypergraphs - David Conlon; Hiêp Hàn; Yury Person; Mathias Schacht (Random Struct. Algorithms, 2012)

Complete Partite subgraphs in dense hypergraphs - Vojtech Rödl; Mathias Schacht (Random Struct. Algorithms, 2012)

Untangling planar graphs from a specified vertex position - Hard cases - Mihyun Kang; Oleg Pikhurko; Alexander Ravsky; Mathias Schacht; Oleg Verbitsky (Discret. Appl. Math., 2011)

An expected polynomial time algorithm for coloring 2-colorable 3-graphs - Yury Person; Mathias Schacht (Discret. Math. Theor. Comput. Sci., 2011)

Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs - Enno Buß; Hiêp Hàn; Mathias Schacht (Electron. Notes Discret. Math., 2011)

Note on forcing pairs - Hiêp Hàn; Yury Person; Mathias Schacht (Electron. Notes Discret. Math., 2011)

Regular partitions of hypergraphs and property testing - Mathias Schacht (HU Berlin, Germany, 2010)

Weak hypergraph regularity and linear hypergraphs - Yoshiharu Kohayakawa; Brendan Nagle; Vojtech Rödl; Mathias Schacht (J. Comb. Theory B, 2010)

Dirac-type results for loose Hamilton cycles in uniform hypergraphs - Hiêp Hàn; Mathias Schacht (J. Comb. Theory B, 2010)

Ramsey properties of random discrete structures - Ehud Friedgut; Vojtech Rödl; Mathias Schacht (Random Struct. Algorithms, 2010)

Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions - Noga Alon; Amin Coja-Oghlan; Hiêp Hàn; Mihyun Kang; Vojtech Rödl; Mathias Schacht (SIAM J. Comput., 2010)

Note on Bipartite Graph Tilings - Jan Hladký; Mathias Schacht (SIAM J. Discret. Math., 2010)

Generalizations of the removal lemma - Vojtech Rödl; Mathias Schacht (Comb., 2009)

On Colourings of Hypergraphs Without Monochromatic Fano Planes - Hanno Lefmann; Yury Person; Vojtech Rödl; Mathias Schacht (Comb. Probab. Comput., 2009)

An expected polynomial time algorithm for coloring 2-colorable 3-graphs - Yury Person; Mathias Schacht (Electron. Notes Discret. Math., 2009)

Note on strong refutation algorithms for random k-SAT formulas - Hiêp Hàn; Yury Person; Mathias Schacht (Electron. Notes Discret. Math., 2009)

On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree - Hiêp Hàn; Yury Person; Mathias Schacht (SIAM J. Discret. Math., 2009)

Almost all hypergraphs without Fano planes are bipartite - Yury Person; Mathias Schacht (Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009, 2009)

Hypergraph regularity and quasi-randomness - Brendan Nagle; Annika Poerschke; Vojtech Rödl; Mathias Schacht (Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009, 2009)

Note on the 3-graph counting lemma - Brendan Nagle; Vojtech Rödl; Mathias Schacht (Discret. Math., 2008)

On the Ramsey Number of Sparse 3-Graphs - Brendan Nagle; Sayaka Olsen; Vojtech Rödl; Mathias Schacht (Graphs Comb., 2008)

Spanning 3-colourable subgraphs of small bandwidth in dense graphs - Julia Böttcher; Mathias Schacht; Anusch Taraz (J. Comb. Theory B, 2008)

Obfuscated Drawings of Planar Graphs - Mihyun Kang; Oleg Pikhurko; Alexander Ravsky; Mathias Schacht; Oleg Verbitsky (CoRR, 2008)

Regular Partitions of Hypergraphs: Regularity Lemmas - Vojtech Rödl; Mathias Schacht (Comb. Probab. Comput., 2007)

Regular Partitions of Hypergraphs: Counting Lemmas - Vojtech Rödl; Mathias Schacht (Comb. Probab. Comput., 2007)

Embedding spanning subgraphs of small bandwidth - Julia Böttcher; Mathias Schacht; Anusch Taraz (Electron. Notes Discret. Math., 2007)

Integer and fractional packings of hypergraphs - Vojtech Rödl; Mathias Schacht; Mark H. Siggers; Norihide Tokushige (J. Comb. Theory B, 2007)

Turán's theorem for pseudo-random graphs - Yoshiharu Kohayakawa; Vojtech Rödl; Mathias Schacht; Papa A. Sissokho; Jozef Skokan (J. Comb. Theory A, 2007)

Every Monotone 3-Graph Property is Testable - Christian Avart; Vojtech Rödl; Mathias Schacht (SIAM J. Discret. Math., 2007)

Ramsey Properties of Random k-Partite, k-Uniform Hypergraphs - Vojtech Rödl; Andrzej Rucinski; Mathias Schacht (SIAM J. Discret. Math., 2007)

Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions - Noga Alon; Amin Coja-Oghlan; Hiêp Hàn; Mihyun Kang; Vojtech Rödl; Mathias Schacht (Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings, 2007)

On the bandwidth conjecture for 3-colourable graphs - Julia Böttcher; Mathias Schacht; Anusch Taraz (Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007, 2007)

Property testing in hypergraphs and the removal lemma - Vojtech Rödl; Mathias Schacht (Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007, 2007)

The counting lemma for regular k-uniform hypergraphs - Brendan Nagle; Vojtech Rödl; Mathias Schacht (Random Struct. Algorithms, 2006)

Globally bounded local edge colourings of hypergraphs - Mathias Schacht; Anusch Taraz (Electron. Notes Discret. Math., 2005)

Every Monotone 3-Graph Property is Testable - Christian Avart; Vojtech Rödl; Mathias Schacht (Electron. Notes Discret. Math., 2005)

The Turán Theorem for Random Graphs - Yoshiharu Kohayakawa; Vojtech Rödl; Mathias Schacht (Comb. Probab. Comput., 2004)