|
|
Fields of Interest
- Graph theory
- Ramsey theory and extremal combinatorics
- Random discrete structures and probabilistic methods
- Theoretical computer science
I plan to attend
- Bremen-Hamburg workshop on Algorithms, Combinatorics and Optimization,
Hamburg, May 13-14, 2025
- Berlin-Poznań-Hamburg-Warsaw seminar in discrete mathematics,
Warsaw, May 15-17, 2025
-
IASM-BIRS-Workshop
on Frontiers in Combinatorics and Theoretical Computer Science,
Institute for Advanced Study in Mathematics, Hangzhou, China, June 8-13, 2025
-
International Congress of Basic Science,
Beijing, China, July, 2025
-
Summer Session on Probabilistic and Extremal Combinatorics,
IAS/Park City Mathematics Institute, Park City, Utah, USA, July, 2025
-
MFO-Workshop
on Combinatorics, Probability and Computing,
Oberwolfach, Germany, September 14-19, 2025
Selected publications
- Chr. Reiher, V. Rödl, M. Schacht,
On a Turán problem in weakly
quasirandom 3-uniform hypergraphs,
Journal of the European Mathematical Society 20(5), 2018, 1139-1159
- M. Schacht,
Extremal results for random discrete structures,
Annals of Mathematics 184(2), 2016, 331-363
- D. Conlon, W. T. Gowers, W. Samotij, M. Schacht,
On the KŁR conjecture in random graphs,
Israel Journal of Mathematics 203(1), 2014, 535-580
- Y. Kohayakawa, V. Rödl, M. Schacht, E. Szemerédi,
Sparse partition universal graphs for graphs of bounded degree,
Advances in Mathematics 226(6), 2011, 5041-5065
- J. Böttcher, M. Schacht, A. Taraz,
Proof of the bandwidth conjecture of Bollobás and Komlós,
Mathematische Annalen 343(1), 2009, 175-205
- B. Nagle, V. Rödl, M. Schacht,
The counting lemma for regular k-uniform hypergraphs,
Random Structures and Algorithms 28(2), 2006, 113-179
Further informationen
|
|
