Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Mathias Schacht
Observed names:
M. SCHACHT,
M. Schacht,
MATHIAS SCHACHT,
Schacht, Mathias
Institution:
Universität Hamburg
Observed institutions:
University of Nevada, Reno,
Emory University,
Universität Hamburg,
Universidade de São Paulo,
Universidade Federal do Ceará,
University of South Florida,
Humboldt-Universität zu Berlin,
Czech Technical University in Prague
show all 8
ORCID:
0000-0003-1762-4090
Observed ORCID:
0000-0003-1762-4090
OpenAlex ID:
A5048188412
The counting lemma for regulark‐uniform hypergraphs
2006
·
Brendan Nagle
, Vojtěch Rödl
, et al.
·
Random Structures and Algorithms
·
247
The counting lemma for regular k-uniform hypergraphs
·
Brendan Nagle
, Vojtech Rödl
, et al.
·
203
Extremal results for random discrete structures
2016
·
Mathias Schacht
·
Annals of Mathematics
·
200
PDF
On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
2009
·
Hip Hàn
, Yury Person
, et al.
·
SIAM Journal on Discrete Mathematics
·
149
Extremal Results for Random Discrete Structures
·
Mathias Schacht
·
140
Regular Partitions of Hypergraphs: Regularity Lemmas
2007
·
VOJTĚCH RÖDL
, MATHIAS SCHACHT
·
Combinatorics Probability Computing
·
120
PDF
Proof of the bandwidth conjecture of Bollobás and Komlós
2008
·
Julia Böttcher
, Mathias Schacht
, et al.
·
Mathematische Annalen
·
116
Weak hypergraph regularity and linear hypergraphs
2009
·
Yoshiharu Kohayakawa
, Brendan Nagle
, et al.
·
Journal of Combinatorial Theory Series B
·
108
Dirac-type results for loose Hamilton cycles in uniform hypergraphs
2009
·
Hiệp Hàn
, Mathias Schacht
·
Journal of Combinatorial Theory Series B
·
91
PDF
On the KŁR conjecture in random graphs
2014
·
D. Conlon
, W. T. Gowers
, et al.
·
Israel Journal of Mathematics
·
87
PDF
Weak quasi‐randomness for uniform hypergraphs
2011
·
David Conlon
, Hiêp Hàn
, et al.
·
Random Structures and Algorithms
·
76
Generalizations of the removal lemma
2009
·
Vojtěch Rödl
, Mathias Schacht
·
COMBINATORICA
·
71
Regular Partitions of Hypergraphs: Counting Lemmas
2007
·
VOJTĚCH RÖDL
, MATHIAS SCHACHT
·
Combinatorics Probability Computing
·
71
Ramsey properties of random discrete structures
2010
·
Ehud Friedgut
, Vojtěch Rödl
, et al.
·
Random Structures and Algorithms
·
69
Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs
2019
·
Christian Reiher
, Vojtěch Rödl
, et al.
·
Proceedings of the London Mathematical Society
·
63
PDF
Sparse partition universal graphs for graphs of bounded degree
2011
·
Yoshiharu Kohayakawa
, Vojtěch Rödl
, et al.
·
Advances in Mathematics
·
62
Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs
2013
·
Enno Buß
, Hiệp Hàn
, et al.
·
Journal of Combinatorial Theory Series B
·
61
PDF
On a Turán problem in weakly quasirandom 3-uniform hypergraphs
2018
·
Christian Reiher
, Vojtěch Rödl
, et al.
·
Journal of the European Mathematical Society
·
60
PDF
The hypergraph regularity method and its applications
2005
·
V. Rödl
, B. Nagle
, et al.
·
Proceedings of the National Academy of Sciences
·
59
Regularity Lemmas for Graphs
2010
·
Vojtěch Rödl
, Mathias Schacht
·
Bolyai Society mathematical studies
·
53
Extremal Hypergraph Problems and the Regularity Method
2007
·
Brendan Nagle
, Vojtěch Rödl
, et al.
·
Springer eBooks
·
51
Hypergraphs with vanishing Turán density in uniformly dense hypergraphs
2017
·
Christian Reiher
, Vojtěch Rödl
, et al.
·
Journal of the London Mathematical Society
·
50
PDF
Powers of Hamiltonian cycles in randomly augmented graphs
2019
·
Andrzej Dudek
, Christian Reiher
, et al.
·
Random Structures and Algorithms
·
46
PDF
Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions
2010
·
Noga Alon
, Amin Coja-Oghlan
, et al.
·
SIAM Journal on Computing
·
42
On a generalisation of Mantel’s Theorem to Uniformly Dense Hypergraphs
2017
·
Christian Reiher
, Vojtĕch Rödl
, et al.
·
International Mathematics Research Notices
·
38
PDF
Show more works
View as search
Works count:
154
Citation count:
3,643
H-index:
33
I10-index:
76
Year
Topic
Type