Ramsey Properties of Randomly Perturbed Hypergraphs. - Aigner-Horev, Elad; Hefetz, Dan; Schacht, Mathias (2024)

Canonical colourings in random graphs. - Kamcev, Nina; Schacht, Mathias (2023)

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

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

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

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

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

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

Turán density of cliques of order five in 3-uniform hypergraphs with quasirandom links. - Berger, Sören; Piga, Simón; Reiher, Christian; Rödl, Vojtech; Schacht, Mathias (2021)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

An Algorithmic Hypergraph Regularity Lemma. - Nagle, Brendan; Rödl, Vojtech; Schacht, Mathias (2016)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Almost all hypergraphs without Fano planes are bipartite. - Person, Yury; Schacht, Mathias (2009)

Hypergraph regularity and quasi-randomness. - Nagle, Brendan; Poerschke, Annika; Rödl, Vojtech; Schacht, Mathias (2009)

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

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

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

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

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

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

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

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

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

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

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

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

On the bandwidth conjecture for 3-colourable graphs. - Böttcher, Julia; Schacht, Mathias; Taraz, Anusch (2007)

Property testing in hypergraphs and the removal lemma. - Rödl, Vojtech; Schacht, Mathias (2007)

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

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

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

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