Mathias Schacht

Publication Activity (10 Years)

Years Active: 2004-2023
Publications (10 Years): 32

Top Topics

Graph Theoretic

Johnson Lindenstrauss

Top Venues

Electron. Notes Discret. Math.

Random Struct. Algorithms

Comb. Probab. Comput.

J. Graph Theory

Publications

Nina Kamcev, Mathias Schacht
Canonical colourings in random graphs. LAGOS (2023)
Pedro Araújo, Simón Piga, Mathias Schacht
Localized Codegree Conditions for Tight Hamilton Cycles in 3-Uniform Hypergraphs. SIAM J. Discret. Math. 36 (1) (2022)
Dennis Clemens, Meysam Miralaei, Damian Reding, Mathias Schacht, Anusch Taraz
On the size-Ramsey number of grid graphs. Comb. Probab. Comput. 30 (5) (2021)
Hiêp Hàn, Troy Retter, Vojtech Rödl, Mathias Schacht
Ramsey-type numbers involving graphs and hypergraphs with large girth. Comb. Probab. Comput. 30 (5) (2021)
Deepak Bal, Ross Berkowitz, Pat Devlin, Mathias Schacht
Hamiltonian Berge cycles in random hypergraphs. Comb. Probab. Comput. 30 (2) (2021)
Deepak Bal, Ross Berkowitz, Pat Devlin, Mathias Schacht
Finding tight Hamilton cycles in random hypergraphs faster. Comb. Probab. Comput. 30 (2) (2021)
Sören Berger, Simón Piga, Christian Reiher, Vojtech Rödl, Mathias Schacht
Turán density of cliques of order five in 3-uniform hypergraphs with quasirandom links. LAGOS (2021)
Sylwia Antoniuk, Andrzej Dudek, Christian Reiher, Andrzej Rucinski, Mathias Schacht
High powers of Hamiltonian cycles in randomly augmented graphs. J. Graph Theory 98 (2) (2021)
Andrzej Dudek, Christian Reiher, Andrzej Rucinski, Mathias Schacht
Powers of Hamiltonian cycles in randomly augmented graphs. Random Struct. Algorithms 56 (1) (2020)
Heiner Oberkampf, Mathias Schacht
On the structure of Dense graphs with bounded clique number. Comb. Probab. Comput. 29 (5) (2020)
Oliver Ebsen, Mathias Schacht
Homomorphism Thresholds for Odd Cycles. Comb. 40 (1) (2020)
Oliver Ebsen, Giulia S. Maesaka, Christian Reiher, Mathias Schacht, Bjarne Schülke
Embedding spanning subgraphs in uniformly dense and inseparable graphs. Random Struct. Algorithms 57 (4) (2020)
Bhargav P. Narayanan, Mathias Schacht
Sharp thresholds for nonlinear Hamiltonian cycles in hypergraphs. Random Struct. Algorithms 57 (1) (2020)
Wiebke Bedenknecht, Guilherme Oliveira Mota, Christian Reiher, Mathias Schacht
On the local density problem for graphs of given odd-girth. J. Graph Theory 90 (2) (2019)
Josefran de Oliveira Bastos, Guilherme Oliveira Mota, Mathias Schacht, Jakob Schnitzer, Fabian Schulenburg
Loose Hamiltonian cycles forced by large (k-2)-degree - sharp version. Contributions Discret. Math. 13 (2) (2018)
Mathias Schacht, Fabian Schulenburg
Sharp thresholds for Ramsey properties of strictly balanced nearly bipartite graphs. Random Struct. Algorithms 52 (1) (2018)
Brendan Nagle, Vojtech Rödl, Mathias Schacht
An algorithmic hypergraph regularity lemma. Random Struct. Algorithms 52 (2) (2018)
Elad Aigner-Horev, David Conlon, Hiêp Hàn, Yury Person, Mathias Schacht
Quasirandomness in Hypergraphs. Electron. J. Comb. 25 (3) (2018)
Christian Reiher, Vojtech Rödl, Mathias Schacht
Hypergraphs with vanishing Turán density in uniformly dense hypergraphs. J. Lond. Math. Soc. 97 (1) (2018)
Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Mathias Schacht, Anusch Taraz
Counting results for sparse pseudorandom hypergraphs I. Eur. J. Comb. 65 (2017)
Wiebke Bedenknecht, Guilherme Oliveira Mota, Christian Reiher, Mathias Schacht
On the local density problem for graphs of given odd-girth. Electron. Notes Discret. Math. 62 (2017)
Elad Aigner-Horev, David Conlon, Hiêp Hàn, Yury Person, Mathias Schacht
Quasirandomness in hypergraphs. Electron. Notes Discret. Math. 61 (2017)
Josefran de Oliveira Bastos, Guilherme Oliveira Mota, Mathias Schacht, Jakob Schnitzer, Fabian Schulenburg
Loose Hamiltonian cycles forced by large (k - 2)-degree - sharp version. Electron. Notes Discret. Math. 61 (2017)
Vojtech Rödl, Andrzej Rucinski, Mathias Schacht
An exponential-type upper bound for Folkman numbers. Comb. 37 (4) (2017)
Vojtech Rödl, Andrzej Rucinski, Mathias Schacht
Ramsey properties of random graphs and Folkman numbers. Discuss. Math. Graph Theory 37 (3) (2017)
Josefran de Oliveira Bastos, Guilherme Oliveira Mota, Mathias Schacht, Jakob Schnitzer, Fabian Schulenburg
Loose Hamiltonian Cycles Forced by Large (k-2)-Degree - Approximate Version. SIAM J. Discret. Math. 31 (4) (2017)
Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Mathias Schacht
Monochromatic trees in random graphs. Electron. Notes Discret. Math. 61 (2017)
Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Mathias Schacht, Anusch Taraz
Counting results for sparse pseudorandom hypergraphs II. Eur. J. Comb. 65 (2017)
Silvia Messuti, Vojtech Rödl, Mathias Schacht
Packing minor-closed families of graphs into complete graphs. J. Comb. Theory, Ser. B 119 (2016)
Brendan Nagle, Vojtech Rödl, Mathias Schacht
An Algorithmic Hypergraph Regularity Lemma. SODA (2016)
Christian Reiher, Vojtech Rödl, Mathias Schacht
Embedding tetrahedra into quasirandom hypergraphs. J. Comb. Theory, Ser. B 121 (2016)
Josefran de Oliveira Bastos, Guilherme Oliveira Mota, Mathias Schacht, Jakob Schnitzer, Fabian Schulenburg
Loose Hamiltonian cycles forced by (k - 2)-degree - approximate version. Electron. Notes Discret. Math. 54 (2016)
Silvia Messuti, Mathias Schacht
On the Structure of Graphs with Given Odd Girth and Large Minimum Degree. J. Graph Theory 80 (1) (2015)
Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Mathias Schacht, Anusch Taraz
A counting lemma for sparse pseudorandom hypergraphs. Electron. Notes Discret. Math. 50 (2015)
Silvia Messuti, Vojtech Rödl, Mathias Schacht
Packing minor closed families of graphs. Electron. Notes Discret. Math. 49 (2015)
Guilherme Oliveira Mota, Gábor N. Sárközy, Mathias Schacht, Anusch Taraz
Ramsey numbers for bipartite graphs with small bandwidth. Eur. J. Comb. 48 (2015)
Hiêp Hàn, Troy Retter, Vojtech Rödl, Mathias Schacht
Ramsey-type numbers involving graphs and hypergraphs with large girth. Electron. Notes Discret. Math. 50 (2015)
Yoshiharu Kohayakawa, Mathias Schacht, Reto Spöhel
Upper bounds on probability thresholds for asymmetric Ramsey properties. Random Struct. Algorithms 44 (1) (2014)
Elad Aigner-Horev, Hiêp Hàn, Mathias Schacht
Extremal results for odd cycles in sparse pseudorandom graphs. Comb. 34 (4) (2014)
Enno Buß, Hiêp Hàn, Mathias Schacht
Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs. J. Comb. Theory, Ser. B 103 (6) (2013)
Elad Aigner-Horev, Hiêp Hàn, Mathias Schacht
Extremal results for odd cycles in sparse pseudorandom graphs. Electron. Notes Discret. Math. 44 (2013)
Vojtech Rödl, Mathias Schacht
Complete Partite subgraphs in dense hypergraphs. Random Struct. Algorithms 41 (4) (2012)
David Conlon, Hiêp Hàn, Yury Person, Mathias Schacht
Weak quasi-randomness for uniform hypergraphs. Random Struct. Algorithms 40 (1) (2012)
Domingos Dellamonica Jr., Penny E. Haxell, Tomasz Luczak, Dhruv Mubayi, Brendan Nagle, Yury Person, Vojtech Rödl, Mathias Schacht, Jacques Verstraëte
On Even-Degree Subgraphs of Linear Hypergraphs. Comb. Probab. Comput. 21 (1-2) (2012)
Mihyun Kang, Oleg Pikhurko, Alexander Ravsky, Mathias Schacht, Oleg Verbitsky
Untangling planar graphs from a specified vertex position - Hard cases. Discret. Appl. Math. 159 (8) (2011)
Hiêp Hàn, Yury Person, Mathias Schacht
Note on forcing pairs. Electron. Notes Discret. Math. 38 (2011)
Enno Buß, Hiêp Hàn, Mathias Schacht
Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs. Electron. Notes Discret. Math. 38 (2011)
Yury Person, Mathias Schacht
An expected polynomial time algorithm for coloring 2-colorable 3-graphs. Discret. Math. Theor. Comput. Sci. 13 (2) (2011)
Noga Alon, Amin Coja-Oghlan, Hiêp Hàn, Mihyun Kang, Vojtech Rödl, Mathias Schacht
Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions. SIAM J. Comput. 39 (6) (2010)
Jan Hladký, Mathias Schacht
Note on Bipartite Graph Tilings. SIAM J. Discret. Math. 24 (2) (2010)
Ehud Friedgut, Vojtech Rödl, Mathias Schacht
Ramsey properties of random discrete structures. Random Struct. Algorithms 37 (4) (2010)
Yoshiharu Kohayakawa, Brendan Nagle, Vojtech Rödl, Mathias Schacht
Weak hypergraph regularity and linear hypergraphs. J. Comb. Theory, Ser. B 100 (2) (2010)
Hiêp Hàn, Mathias Schacht
Dirac-type results for loose Hamilton cycles in uniform hypergraphs. J. Comb. Theory, Ser. B 100 (3) (2010)
Brendan Nagle, Annika Poerschke, Vojtech Rödl, Mathias Schacht
Hypergraph regularity and quasi-randomness. SODA (2009)
Hiêp Hàn, Yury Person, Mathias Schacht
Note on strong refutation algorithms for random k-SAT formulas. Electron. Notes Discret. Math. 35 (2009)
Vojtech Rödl, Mathias Schacht
Generalizations of the removal lemma. Comb. 29 (4) (2009)
Yury Person, Mathias Schacht
Almost all hypergraphs without Fano planes are bipartite. SODA (2009)
Hanno Lefmann, Yury Person, Vojtech Rödl, Mathias Schacht
On Colourings of Hypergraphs Without Monochromatic Fano Planes. Comb. Probab. Comput. 18 (5) (2009)
Hiêp Hàn, Yury Person, Mathias Schacht
On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree. SIAM J. Discret. Math. 23 (2) (2009)
Yury Person, Mathias Schacht
An expected polynomial time algorithm for coloring 2-colorable 3-graphs. Electron. Notes Discret. Math. 34 (2009)
Brendan Nagle, Sayaka Olsen, Vojtech Rödl, Mathias Schacht
On the Ramsey Number of Sparse 3-Graphs. Graphs Comb. 24 (3) (2008)
Mihyun Kang, Oleg Pikhurko, Alexander Ravsky, Mathias Schacht, Oleg Verbitsky
Obfuscated Drawings of Planar Graphs CoRR (2008)
Brendan Nagle, Vojtech Rödl, Mathias Schacht
Note on the 3-graph counting lemma. Discret. Math. 308 (19) (2008)
Julia Böttcher, Mathias Schacht, Anusch Taraz
Spanning 3-colourable subgraphs of small bandwidth in dense graphs. J. Comb. Theory, Ser. B 98 (4) (2008)
Vojtech Rödl, Mathias Schacht, Mark H. Siggers, Norihide Tokushige
Integer and fractional packings of hypergraphs. J. Comb. Theory, Ser. B 97 (2) (2007)
Vojtech Rödl, Mathias Schacht
Regular Partitions of Hypergraphs: Regularity Lemmas. Comb. Probab. Comput. 16 (6) (2007)
Christian Avart, Vojtech Rödl, Mathias Schacht
Every Monotone 3-Graph Property is Testable. SIAM J. Discret. Math. 21 (1) (2007)
Vojtech Rödl, Mathias Schacht
Property testing in hypergraphs and the removal lemma. STOC (2007)
Vojtech Rödl, Andrzej Rucinski, Mathias Schacht
Ramsey Properties of Random k-Partite, k-Uniform Hypergraphs. SIAM J. Discret. Math. 21 (2) (2007)
Noga Alon, Amin Coja-Oghlan, Hiêp Hàn, Mihyun Kang, Vojtech Rödl, Mathias Schacht
Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions. ICALP (2007)
Vojtech Rödl, Mathias Schacht
Regular Partitions of Hypergraphs: Counting Lemmas. Comb. Probab. Comput. 16 (6) (2007)
Julia Böttcher, Mathias Schacht, Anusch Taraz
Embedding spanning subgraphs of small bandwidth. Electron. Notes Discret. Math. 29 (2007)
Julia Böttcher, Mathias Schacht, Anusch Taraz
On the bandwidth conjecture for 3-colourable graphs. SODA (2007)
Yoshiharu Kohayakawa, Vojtech Rödl, Mathias Schacht, Papa A. Sissokho, Jozef Skokan
Turán's theorem for pseudo-random graphs. J. Comb. Theory, Ser. A 114 (4) (2007)
Brendan Nagle, Vojtech Rödl, Mathias Schacht
-uniform hypergraphs. Random Struct. Algorithms 28 (2) (2006)
Mathias Schacht, Anusch Taraz
Globally bounded local edge colourings of hypergraphs. Electron. Notes Discret. Math. 19 (2005)
Christian Avart, Vojtech Rödl, Mathias Schacht
Every Monotone 3-Graph Property is Testable. Electron. Notes Discret. Math. 22 (2005)
Yoshiharu Kohayakawa, Vojtech Rödl, Mathias Schacht
The Turán Theorem for Random Graphs. Comb. Probab. Comput. 13 (1) (2004)