Mathias Schacht, Ph.D.

Affiliations: 
2004 Emory University, Atlanta, GA 
Area:
Mathematics
Google:
"Mathias Schacht"

Parents

Sign in to add mentor
Vojtech Rodl grad student 2004 Emory
 (On the regularity method for hypergraphs.)
BETA: Related publications

Publications

You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect.

Bal D, Berkowitz R, Devlin P, et al. (2020) Hamiltonian Berge cycles in random hypergraphs Combinatorics, Probability & Computing. 1-11
Oberkampf H, Schacht M. (2020) On the structure of dense graphs with fixed clique number Combinatorics, Probability & Computing. 29: 641-649
Polcyn J, Reiher C, Rödl V, et al. (2020) Minimum pair degree condition for tight Hamiltonian cycles in 4-uniform hypergraphs Acta Mathematica Hungarica. 161: 647-699
Ebsen O, Schacht M. (2020) Homomorphism thresholds for odd cycles Combinatorica. 40: 39-62
Ebsen O, Maesaka GS, Reiher C, et al. (2020) Embedding spanning subgraphs in uniformly dense and inseparable graphs Random Structures and Algorithms
Dudek A, Reiher C, Ruciński A, et al. (2020) Powers of Hamiltonian cycles in randomly augmented graphs Random Structures and Algorithms. 56: 122-141
Reiher C, Rödl V, Ruciński A, et al. (2019) Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs Proceedings of the London Mathematical Society. 119: 409-439
Reiher C, Schacht M. (2019) Forcing Quasirandomness With Triangles Forum of Mathematics, Sigma. 7
Bedenknecht W, Mota GO, Reiher C, et al. (2019) On the local density problem for graphs of given odd‐girth Journal of Graph Theory. 90: 137-149
Reiher C, Rödl V, Schacht M. (2018) On a Turán problem in weakly quasirandom 3-uniform hypergraphs Journal of the European Mathematical Society. 20: 1139-1159
See more...