×
Author ID: schacht.mathias Recent zbMATH articles by "Schacht, Mathias"
Published as: Schacht, Mathias; Schacht, M.
Homepage: http://www.math.uni-hamburg.de/home/schacht/
External Links: MGP · ORCID · Wikidata · dblp · GND

Publications by Year

Citations contained in zbMATH Open

90 Publications have been cited 1,083 times in 605 Documents Cited by Year
The counting lemma for regular \(k\)-uniform hypergraphs. Zbl 1093.05045
Nagle, Brendan; Rödl, Vojtěch; Schacht, Mathias
88
2006
Extremal results for random discrete structures. Zbl 1351.05207
Schacht, Mathias
71
2016
On perfect matchings in uniform hypergraphs with large minimum vertex degree. Zbl 1191.05074
Hàn, Hip; Person, Yury; Schacht, Mathias
62
2009
Regular partitions of hypergraphs: regularity lemmas. Zbl 1206.05071
Rödl, Vojtěch; Schacht, Mathias
52
2007
Weak hypergraph regularity and linear hypergraphs. Zbl 1216.05094
Kohayakawa, Yoshiharu; Nagle, Brendan; Rödl, Vojtěch; Schacht, Mathias
39
2010
Dirac-type results for loose Hamilton cycles in uniform hypergraphs. Zbl 1209.05161
Hàn, Hiệp; Schacht, Mathias
39
2010
Proof of the bandwidth conjecture of Bollobás and Komlós. Zbl 1229.05132
Böttcher, Julia; Schacht, Mathias; Taraz, Anusch
39
2009
Weak quasi-randomness for uniform hypergraphs. Zbl 1236.05137
Conlon, David; Hàn, Hiệp; Person, Yury; Schacht, Mathias
35
2012
On the KŁR conjecture in random graphs. Zbl 1303.05175
Conlon, D.; Gowers, W. T.; Samotij, W.; Schacht, M.
34
2014
Ramsey properties of random discrete structures. Zbl 1228.05284
Friedgut, Ehud; Rödl, Vojtěch; Schacht, Mathias
33
2010
Regular partitions of hypergraphs: counting lemmas. Zbl 1206.05072
Rödl, Vojtěch; Schacht, Mathias
29
2007
Generalizations of the removal lemma. Zbl 1212.05133
Rödl, Vojtěch; Schacht, Mathias
22
2009
On colourings of hypergraphs without monochromatic Fano planes. Zbl 1197.05053
Lefmann, Hanno; Person, Yury; Rödl, Vojtěch; Schacht, Mathias
21
2009
Powers of Hamiltonian cycles in randomly augmented graphs. Zbl 1444.05080
Dudek, Andrzej; Reiher, Christian; Ruciński, Andrzej; Schacht, Mathias
20
2020
Sparse partition universal graphs for graphs of bounded degree. Zbl 1227.05196
Kohayakawa, Yoshiharu; Rödl, Vojtěch; Schacht, Mathias; Szemerédi, Endre
19
2011
Minimum vertex degree condition for tight Hamiltonian cycles in 3-uniform hypergraphs. Zbl 1422.05077
Reiher, Christian; Rödl, Vojtěch; Ruciński, Andrzej; Schacht, Mathias; Szemerédi, Endre
19
2019
Extremal hypergraph problems and the regularity method. Zbl 1116.05041
Nagle, Brendan; Rödl, Vojtěch; Schacht, Mathias
18
2006
Quasi-randomness and algorithmic regularity for graphs with general degree distributions. Zbl 1227.05225
Alon, Noga; Coja-Oghlan, Amin; Hàn, Hiệp; Kang, Mihyun; Rödl, Vojtěch; Schacht, Mathias
18
2010
A structural result for hypergraphs with many restricted edge colorings. Zbl 1244.05160
Lefmann, Hanno; Person, Yury; Schacht, Mathias
17
2010
Regularity lemmas for graphs. Zbl 1218.05147
Rödl, Vojtěch; Schacht, Mathias
17
2010
The Turán theorem for random graphs. Zbl 1048.05075
Kohayakawa, Yoshiharu; Rödl, Vojtěch; Schacht, Mathias
16
2004
On the Ramsey number of sparse 3-graphs. Zbl 1169.05024
Nagle, Brendan; Olsen, Sayaka; Rödl, Vojtěch; Schacht, Mathias
15
2008
Packing minor-closed families of graphs into complete graphs. Zbl 1334.05121
Messuti, Silvia; Rödl, Vojtěch; Schacht, Mathias
14
2016
Ramsey properties of random \(k\)-partite, \(k\)-uniform hypergraphs. Zbl 1140.05043
Rödl, Vojtěch; Ruciński, Andrzej; Schacht, Mathias
13
2007
The hypergraph regularity method and its applications. Zbl 1135.05307
Rödl, V.; Nagle, B.; Skokan, J.; Schacht, M.; Kohayakawa, Y.
12
2005
Loose Hamiltonian cycles forced by large \((k-2)\)-degree-approximate version. Zbl 1372.05152
de Oliveira Bastos, Josefran; Oliveira Mota, Guilherme; Schacht, Mathias; Schnitzer, Jakob; Schulenburg, Fabian
12
2017
Almost all hypergraphs without Fano planes are bipartite. Zbl 1423.05114
Person, Yury; Schacht, Mathias
12
2009
Quasirandomness in hypergraphs. Zbl 1395.05182
Aigner-Horev, Elad; Conlon, David; Hàn, Hiệp; Person, Yury; Schacht, Mathias
12
2018
On six problems posed by Jarik Nešetřil. Zbl 1116.05081
Bang-Jensen, Jørgen; Reed, Bruce; Schacht, Mathias; Šámal, Robert; Toft, Bjarne; Wagner, Uli
11
2006
Embedding tetrahedra into quasirandom hypergraphs. Zbl 1348.05141
Reiher, Christian; Rödl, Vojtěch; Schacht, Mathias
11
2016
Extremal results in random graphs. Zbl 1304.05125
Rödl, Vojtěch; Schacht, Mathias
11
2013
Untangling planar graphs from a specified vertex position-Hard cases. Zbl 1219.05046
Kang, M.; Pikhurko, O.; Ravsky, A.; Schacht, M.; Verbitsky, O.
10
2011
On a Turán problem in weakly quasirandom 3-uniform hypergraphs. Zbl 1387.05125
Reiher, Christian; Rödl, Vojtěch; Schacht, Mathias
10
2018
Spanning 3-colourable subgraphs of small bandwidth in dense graphs. Zbl 1149.05021
Böttcher, Julia; Schacht, Mathias; Taraz, Anusch
10
2008
Turán’s theorem for pseudo-random graphs. Zbl 1120.05084
Kohayakawa, Yoshiharu; Rödl, Vojtěch; Schacht, Mathias; Sissokho, Papa; Skokan, Jozef
8
2007
Density theorems and extremal hypergraph problems. Zbl 1127.05055
Rödl, V.; Schacht, M.; Tengan, E.; Tokushige, N.
8
2006
Property testing in hypergraphs and the removal lemma. Zbl 1232.68174
Rödl, V.; Schacht, M.
8
2007
Upper bounds on probability thresholds for asymmetric Ramsey properties. Zbl 1280.05084
Kohayakawa, Yoshiharu; Schacht, Mathias; Spöhel, Reto
8
2014
On a generalisation of Mantel’s theorem to uniformly dense hypergraphs. Zbl 1404.05141
Reiher, Christian; Rödl, Vojtĕch; Schacht, Mathias
8
2018
On the triangle removal lemma for subgraphs of sparse pseudorandom graphs. Zbl 1213.05238
Kohayakawa, Yoshiharu; Rödl, Vojtěch; Schacht, Mathias; Skokan, Jozef
7
2010
Sharp thresholds for Ramsey properties of strictly balanced nearly bipartite graphs. Zbl 1378.05128
Schacht, Mathias; Schulenburg, Fabian
7
2018
Loose Hamiltonian cycles forced by large \((k-2)\)-degree – sharp version. Zbl 1409.05142
de Oliveira Bastos, Josefran; Mota, Guilherme Oliveira; Schacht, Mathias; Schnitzer, Jakob; Schulenburg, Fabian
7
2018
A note on perfect matchings in uniform hypergraphs with large minimum collective degree. Zbl 1212.05215
Rödl, Vojtěch; Ruciński, Andrzej; Schacht, Mathias; Szemerédi, Endre
6
2008
Integer and fractional packings of hypergraphs. Zbl 1111.05082
Rödl, V.; Schacht, M.; Siggers, M. H.; Tokushige, N.
6
2007
Hypergraphs with vanishing Turán density in uniformly dense hypergraphs. Zbl 1382.05038
Reiher, Christian; Rödl, Vojtěch; Schacht, Mathias
6
2018
Ramsey numbers for bipartite graphs with small bandwidth. Zbl 1315.05089
Mota, G. O.; Sárközy, G. N.; Schacht, M.; Taraz, A.
6
2015
On the Hamiltonicity of triple systems with high minimum degree. Zbl 1359.05089
Rödl, Vojtěch; Ruciński, Andrzej; Schacht, Mathias; Szemerédi, Endre
6
2017
Hypergraph regularity and quasi-randomness. Zbl 1425.05103
Nagle, Brendan; Poerschke, Annika; Rödl, Vojtěch; Schacht, Mathias
6
2009
A sharp threshold for van der Waerden’s theorem in random subsets. Zbl 1346.05270
Friedgut, Ehud; Hàn, Hiệp; Person, Yury; Schacht, Mathias
6
2016
Some remarks on \(\pi_\wedge\). Zbl 1440.05128
Reiher, Christian; Rödl, Vojtěch; Schacht, Mathias
6
2018
High powers of Hamiltonian cycles in randomly augmented graphs. Zbl 1522.05259
Antoniuk, Sylwia; Dudek, Andrzej; Reiher, Christian; Ruciński, Andrzej; Schacht, Mathias
6
2021
Note on bipartite graph tilings. Zbl 1213.05138
Hladký, Jan; Schacht, Mathias
5
2010
Loose Hamiltonian cycles forced by large \((k-2)\)-degree – sharp version. Zbl 1378.05151
de O. Bastos, J.; Mota, G. O.; Schacht, M.; Schnitzer, J.; Schulenburg, F.
5
2017
Monochromatic trees in random graphs. Zbl 1406.05096
Kohayakawa, Yoshiharu; Mota, Guilherme Oliveira; Schacht, Mathias
5
2019
Every monotone 3-graph property is testable. Zbl 1142.68053
Avart, Christian; Rödl, Vojtěch; Schacht, Mathias
4
2007
Discrepancy and eigenvalues of Cayley graphs. Zbl 1413.05356
Kohayakawa, Yoshiharu; Rödl, Vojtěch; Schacht, Mathias
4
2016
Loose Hamiltonian cycles forced by \((k-2)\)-degree – approximate version. Zbl 1356.05098
de O. Bastos, J.; Mota, G. O.; Schacht, M.; Schnitzer, J.; Schulenburg, F.
4
2016
Forcing quasirandomness with triangles. Zbl 1409.05187
Reiher, Christian; Schacht, Mathias
4
2019
Homomorphism thresholds for odd cycles. Zbl 1449.05149
Ebsen, Oliver; Schacht, Mathias
4
2020
Tree-minimal graphs are almost regular. Zbl 1272.05084
Dellamonica, Domingos jun.; Haxell, Penny E.; Łuczak, Tomasz; Mubayi, Dhruv; Nagle, Brendan; Person, Yury; Rödl, Vojtěch; Schacht, Mathias
4
2012
Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs. Zbl 1274.05335
Buß, Enno; Hàn, Hiệp; Schacht, Mathias
4
2011
On the local density problem for graphs of given odd-girth. Zbl 1466.05112
Bedenknecht, Wiebke; Mota, Guilherme Oliveira; Reiher, Christian; Schacht, Mathias
4
2019
Complete partite subgraphs in dense hypergraphs. Zbl 1255.05151
Rödl, Vojtěch; Schacht, Mathias
4
2012
An algorithmic hypergraph regularity lemma. Zbl 1388.05131
Nagle, Brendan; Rödl, Vojtěch; Schacht, Mathias
4
2018
On even-degree subgraphs of linear hypergraphs. Zbl 1241.05052
Dellamonica, D. jun.; Haxell, P.; Łuczak, T.; Mubayi, D.; Nagle, B.; Person, Y.; Rödl, V.; Schacht, M.; Verstraëte, J.
3
2012
Monochromatic trees in random graphs. Zbl 1379.05025
Kohayakawa, Y.; Mota, G. O.; Schacht, M.
3
2017
Counting results for sparse pseudorandom hypergraphs. II. Zbl 1369.05156
Kohayakawa, Yoshiharu; Mota, Guilherme Oliveira; Schacht, Mathias; Taraz, Anusch
3
2017
Embedding spanning subgraphs in uniformly dense and inseparable graphs. Zbl 1457.05059
Ebsen, Oliver; Maesaka, Giulia S.; Reiher, Christian; Schacht, Mathias; Schülke, Bjarne
3
2020
Sharp thresholds for nonlinear Hamiltonian cycles in hypergraphs. Zbl 1472.05088
Narayanan, Bhargav; Schacht, Mathias
3
2020
An expected polynomial time algorithm for coloring 2-colorable 3-graphs. Zbl 1273.05223
Person, Yury; Schacht, Mathias
3
2009
Note on forcing pairs. Zbl 1274.05440
Hàn, Hiệp; Person, Yury; Schacht, Mathias
3
2011
An algorithmic hypergraph regularity lemma. Zbl 1410.05154
Nagle, Brendan; Rödl, Vojtěch; Schacht, Mathias
3
2016
A note on induced Ramsey numbers. Zbl 1387.05162
Conlon, David; Dellamonica, Domingos; La Fleur, Steven; Rödl, Vojtěch; Schacht, Mathias
2
2017
On the structure of graphs with given odd girth and large minimum degree. Zbl 1321.05124
Messuti, Silvia; Schacht, Mathias
2
2015
Counting results for sparse pseudorandom hypergraphs. I. Zbl 1369.05111
Kohayakawa, Yoshiharu; Mota, Guilherme Oliveira; Schacht, Mathias; Taraz, Anusch
2
2017
Extremal results for odd cycles in sparse pseudorandom graphs. Zbl 1349.05176
Aigner-Horev, Elad; Hán, Hiệp; Schacht, Mathias
2
2014
Ramsey properties of random graphs and folkman numbers. Zbl 1366.05099
Rödl, Vojtěch; Ruciński, Andrzej; Schacht, Mathias
2
2017
Note on the 3-graph counting Lemma. Zbl 1169.05028
Nagle, Brendan; Rödl, Vojtěch; Schacht, Mathias
2
2008
Localized codegree conditions for tight Hamilton cycles in 3-uniform hypergraphs. Zbl 1480.05097
Araújo, Pedro; Piga, Simón; Schacht, Mathias
2
2022
Minimum pair degree condition for tight Hamiltonian cycles in 4-uniform hypergraphs. Zbl 1474.05291
Polcyn, J.; Reiher, Chr.; Rödl, V.; Ruciński, A.; Schacht, M.; Schülke, B.
2
2020
On the structure of dense graphs with bounded clique number. Zbl 1462.05203
Oberkampf, Heiner; Schacht, Mathias
2
2020
On the size-Ramsey number of grid graphs. Zbl 1510.05284
Clemens, Dennis; Miralaei, Meysam; Reding, Damian; Schacht, Mathias; Taraz, Anusch
2
2021
On the local density problem for graphs of given odd-girth. Zbl 1383.05183
Bedenknecht, Wiebke; Mota, Guilherme Oliveira; Reiher, Christian; Schacht, Mathias
1
2017
Quasirandomness in hypergraphs. Zbl 1378.05141
Aigner-Horev, Elad; Conlon, David; Hàn, Hiệp; Person, Yury; Schacht, Mathias
1
2017
On quantitative aspects of a canonisation theorem for edge-orderings. Zbl 1519.05243
Reiher, Christian; Rödl, Vojtěch; Sales, Marcelo; Sames, Kevin; Schacht, Mathias
1
2022
Packing minor closed families of graphs. Zbl 1346.05237
Messuti, Silvia; Rödl, Vojtěch; Schacht, Mathias
1
2015
Ramsey numbers for bipartite graphs with small bandwidth. Zbl 1291.05130
Mota, Guilherme O.; Sárkőzy, Gábor N.; Schacht, Mathias; Taraz, Anusch
1
2013
Note on strong refutation algorithms for random \(k\)-SAT formulas. Zbl 1268.68085
Hàn, Hiệp; Person, Yury; Schacht, Mathias
1
2009
Hamiltonian Berge cycles in random hypergraphs. Zbl 1466.05145
Bal, Deepak; Berkowitz, Ross; Devlin, Pat; Schacht, Mathias
1
2020
An expected polynomial time algorithm for coloring 2-colorable 3-graphs. Zbl 1283.05110
Person, Yury Aleksandrovic; Schacht, Mathias
1
2011
Localized codegree conditions for tight Hamilton cycles in 3-uniform hypergraphs. Zbl 1480.05097
Araújo, Pedro; Piga, Simón; Schacht, Mathias
2
2022
On quantitative aspects of a canonisation theorem for edge-orderings. Zbl 1519.05243
Reiher, Christian; Rödl, Vojtěch; Sales, Marcelo; Sames, Kevin; Schacht, Mathias
1
2022
High powers of Hamiltonian cycles in randomly augmented graphs. Zbl 1522.05259
Antoniuk, Sylwia; Dudek, Andrzej; Reiher, Christian; Ruciński, Andrzej; Schacht, Mathias
6
2021
On the size-Ramsey number of grid graphs. Zbl 1510.05284
Clemens, Dennis; Miralaei, Meysam; Reding, Damian; Schacht, Mathias; Taraz, Anusch
2
2021
Powers of Hamiltonian cycles in randomly augmented graphs. Zbl 1444.05080
Dudek, Andrzej; Reiher, Christian; Ruciński, Andrzej; Schacht, Mathias
20
2020
Homomorphism thresholds for odd cycles. Zbl 1449.05149
Ebsen, Oliver; Schacht, Mathias
4
2020
Embedding spanning subgraphs in uniformly dense and inseparable graphs. Zbl 1457.05059
Ebsen, Oliver; Maesaka, Giulia S.; Reiher, Christian; Schacht, Mathias; Schülke, Bjarne
3
2020
Sharp thresholds for nonlinear Hamiltonian cycles in hypergraphs. Zbl 1472.05088
Narayanan, Bhargav; Schacht, Mathias
3
2020
Minimum pair degree condition for tight Hamiltonian cycles in 4-uniform hypergraphs. Zbl 1474.05291
Polcyn, J.; Reiher, Chr.; Rödl, V.; Ruciński, A.; Schacht, M.; Schülke, B.
2
2020
On the structure of dense graphs with bounded clique number. Zbl 1462.05203
Oberkampf, Heiner; Schacht, Mathias
2
2020
Hamiltonian Berge cycles in random hypergraphs. Zbl 1466.05145
Bal, Deepak; Berkowitz, Ross; Devlin, Pat; Schacht, Mathias
1
2020
Minimum vertex degree condition for tight Hamiltonian cycles in 3-uniform hypergraphs. Zbl 1422.05077
Reiher, Christian; Rödl, Vojtěch; Ruciński, Andrzej; Schacht, Mathias; Szemerédi, Endre
19
2019
Monochromatic trees in random graphs. Zbl 1406.05096
Kohayakawa, Yoshiharu; Mota, Guilherme Oliveira; Schacht, Mathias
5
2019
Forcing quasirandomness with triangles. Zbl 1409.05187
Reiher, Christian; Schacht, Mathias
4
2019
On the local density problem for graphs of given odd-girth. Zbl 1466.05112
Bedenknecht, Wiebke; Mota, Guilherme Oliveira; Reiher, Christian; Schacht, Mathias
4
2019
Quasirandomness in hypergraphs. Zbl 1395.05182
Aigner-Horev, Elad; Conlon, David; Hàn, Hiệp; Person, Yury; Schacht, Mathias
12
2018
On a Turán problem in weakly quasirandom 3-uniform hypergraphs. Zbl 1387.05125
Reiher, Christian; Rödl, Vojtěch; Schacht, Mathias
10
2018
On a generalisation of Mantel’s theorem to uniformly dense hypergraphs. Zbl 1404.05141
Reiher, Christian; Rödl, Vojtĕch; Schacht, Mathias
8
2018
Sharp thresholds for Ramsey properties of strictly balanced nearly bipartite graphs. Zbl 1378.05128
Schacht, Mathias; Schulenburg, Fabian
7
2018
Loose Hamiltonian cycles forced by large \((k-2)\)-degree – sharp version. Zbl 1409.05142
de Oliveira Bastos, Josefran; Mota, Guilherme Oliveira; Schacht, Mathias; Schnitzer, Jakob; Schulenburg, Fabian
7
2018
Hypergraphs with vanishing Turán density in uniformly dense hypergraphs. Zbl 1382.05038
Reiher, Christian; Rödl, Vojtěch; Schacht, Mathias
6
2018
Some remarks on \(\pi_\wedge\). Zbl 1440.05128
Reiher, Christian; Rödl, Vojtěch; Schacht, Mathias
6
2018
An algorithmic hypergraph regularity lemma. Zbl 1388.05131
Nagle, Brendan; Rödl, Vojtěch; Schacht, Mathias
4
2018
Loose Hamiltonian cycles forced by large \((k-2)\)-degree-approximate version. Zbl 1372.05152
de Oliveira Bastos, Josefran; Oliveira Mota, Guilherme; Schacht, Mathias; Schnitzer, Jakob; Schulenburg, Fabian
12
2017
On the Hamiltonicity of triple systems with high minimum degree. Zbl 1359.05089
Rödl, Vojtěch; Ruciński, Andrzej; Schacht, Mathias; Szemerédi, Endre
6
2017
Loose Hamiltonian cycles forced by large \((k-2)\)-degree – sharp version. Zbl 1378.05151
de O. Bastos, J.; Mota, G. O.; Schacht, M.; Schnitzer, J.; Schulenburg, F.
5
2017
Monochromatic trees in random graphs. Zbl 1379.05025
Kohayakawa, Y.; Mota, G. O.; Schacht, M.
3
2017
Counting results for sparse pseudorandom hypergraphs. II. Zbl 1369.05156
Kohayakawa, Yoshiharu; Mota, Guilherme Oliveira; Schacht, Mathias; Taraz, Anusch
3
2017
A note on induced Ramsey numbers. Zbl 1387.05162
Conlon, David; Dellamonica, Domingos; La Fleur, Steven; Rödl, Vojtěch; Schacht, Mathias
2
2017
Counting results for sparse pseudorandom hypergraphs. I. Zbl 1369.05111
Kohayakawa, Yoshiharu; Mota, Guilherme Oliveira; Schacht, Mathias; Taraz, Anusch
2
2017
Ramsey properties of random graphs and folkman numbers. Zbl 1366.05099
Rödl, Vojtěch; Ruciński, Andrzej; Schacht, Mathias
2
2017
On the local density problem for graphs of given odd-girth. Zbl 1383.05183
Bedenknecht, Wiebke; Mota, Guilherme Oliveira; Reiher, Christian; Schacht, Mathias
1
2017
Quasirandomness in hypergraphs. Zbl 1378.05141
Aigner-Horev, Elad; Conlon, David; Hàn, Hiệp; Person, Yury; Schacht, Mathias
1
2017
Extremal results for random discrete structures. Zbl 1351.05207
Schacht, Mathias
71
2016
Packing minor-closed families of graphs into complete graphs. Zbl 1334.05121
Messuti, Silvia; Rödl, Vojtěch; Schacht, Mathias
14
2016
Embedding tetrahedra into quasirandom hypergraphs. Zbl 1348.05141
Reiher, Christian; Rödl, Vojtěch; Schacht, Mathias
11
2016
A sharp threshold for van der Waerden’s theorem in random subsets. Zbl 1346.05270
Friedgut, Ehud; Hàn, Hiệp; Person, Yury; Schacht, Mathias
6
2016
Discrepancy and eigenvalues of Cayley graphs. Zbl 1413.05356
Kohayakawa, Yoshiharu; Rödl, Vojtěch; Schacht, Mathias
4
2016
Loose Hamiltonian cycles forced by \((k-2)\)-degree – approximate version. Zbl 1356.05098
de O. Bastos, J.; Mota, G. O.; Schacht, M.; Schnitzer, J.; Schulenburg, F.
4
2016
An algorithmic hypergraph regularity lemma. Zbl 1410.05154
Nagle, Brendan; Rödl, Vojtěch; Schacht, Mathias
3
2016
Ramsey numbers for bipartite graphs with small bandwidth. Zbl 1315.05089
Mota, G. O.; Sárközy, G. N.; Schacht, M.; Taraz, A.
6
2015
On the structure of graphs with given odd girth and large minimum degree. Zbl 1321.05124
Messuti, Silvia; Schacht, Mathias
2
2015
Packing minor closed families of graphs. Zbl 1346.05237
Messuti, Silvia; Rödl, Vojtěch; Schacht, Mathias
1
2015
On the KŁR conjecture in random graphs. Zbl 1303.05175
Conlon, D.; Gowers, W. T.; Samotij, W.; Schacht, M.
34
2014
Upper bounds on probability thresholds for asymmetric Ramsey properties. Zbl 1280.05084
Kohayakawa, Yoshiharu; Schacht, Mathias; Spöhel, Reto
8
2014
Extremal results for odd cycles in sparse pseudorandom graphs. Zbl 1349.05176
Aigner-Horev, Elad; Hán, Hiệp; Schacht, Mathias
2
2014
Extremal results in random graphs. Zbl 1304.05125
Rödl, Vojtěch; Schacht, Mathias
11
2013
Ramsey numbers for bipartite graphs with small bandwidth. Zbl 1291.05130
Mota, Guilherme O.; Sárkőzy, Gábor N.; Schacht, Mathias; Taraz, Anusch
1
2013
Weak quasi-randomness for uniform hypergraphs. Zbl 1236.05137
Conlon, David; Hàn, Hiệp; Person, Yury; Schacht, Mathias
35
2012
Tree-minimal graphs are almost regular. Zbl 1272.05084
Dellamonica, Domingos jun.; Haxell, Penny E.; Łuczak, Tomasz; Mubayi, Dhruv; Nagle, Brendan; Person, Yury; Rödl, Vojtěch; Schacht, Mathias
4
2012
Complete partite subgraphs in dense hypergraphs. Zbl 1255.05151
Rödl, Vojtěch; Schacht, Mathias
4
2012
On even-degree subgraphs of linear hypergraphs. Zbl 1241.05052
Dellamonica, D. jun.; Haxell, P.; Łuczak, T.; Mubayi, D.; Nagle, B.; Person, Y.; Rödl, V.; Schacht, M.; Verstraëte, J.
3
2012
Sparse partition universal graphs for graphs of bounded degree. Zbl 1227.05196
Kohayakawa, Yoshiharu; Rödl, Vojtěch; Schacht, Mathias; Szemerédi, Endre
19
2011
Untangling planar graphs from a specified vertex position-Hard cases. Zbl 1219.05046
Kang, M.; Pikhurko, O.; Ravsky, A.; Schacht, M.; Verbitsky, O.
10
2011
Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs. Zbl 1274.05335
Buß, Enno; Hàn, Hiệp; Schacht, Mathias
4
2011
Note on forcing pairs. Zbl 1274.05440
Hàn, Hiệp; Person, Yury; Schacht, Mathias
3
2011
An expected polynomial time algorithm for coloring 2-colorable 3-graphs. Zbl 1283.05110
Person, Yury Aleksandrovic; Schacht, Mathias
1
2011
Weak hypergraph regularity and linear hypergraphs. Zbl 1216.05094
Kohayakawa, Yoshiharu; Nagle, Brendan; Rödl, Vojtěch; Schacht, Mathias
39
2010
Dirac-type results for loose Hamilton cycles in uniform hypergraphs. Zbl 1209.05161
Hàn, Hiệp; Schacht, Mathias
39
2010
Ramsey properties of random discrete structures. Zbl 1228.05284
Friedgut, Ehud; Rödl, Vojtěch; Schacht, Mathias
33
2010
Quasi-randomness and algorithmic regularity for graphs with general degree distributions. Zbl 1227.05225
Alon, Noga; Coja-Oghlan, Amin; Hàn, Hiệp; Kang, Mihyun; Rödl, Vojtěch; Schacht, Mathias
18
2010
A structural result for hypergraphs with many restricted edge colorings. Zbl 1244.05160
Lefmann, Hanno; Person, Yury; Schacht, Mathias
17
2010
Regularity lemmas for graphs. Zbl 1218.05147
Rödl, Vojtěch; Schacht, Mathias
17
2010
On the triangle removal lemma for subgraphs of sparse pseudorandom graphs. Zbl 1213.05238
Kohayakawa, Yoshiharu; Rödl, Vojtěch; Schacht, Mathias; Skokan, Jozef
7
2010
Note on bipartite graph tilings. Zbl 1213.05138
Hladký, Jan; Schacht, Mathias
5
2010
On perfect matchings in uniform hypergraphs with large minimum vertex degree. Zbl 1191.05074
Hàn, Hip; Person, Yury; Schacht, Mathias
62
2009
Proof of the bandwidth conjecture of Bollobás and Komlós. Zbl 1229.05132
Böttcher, Julia; Schacht, Mathias; Taraz, Anusch
39
2009
Generalizations of the removal lemma. Zbl 1212.05133
Rödl, Vojtěch; Schacht, Mathias
22
2009
On colourings of hypergraphs without monochromatic Fano planes. Zbl 1197.05053
Lefmann, Hanno; Person, Yury; Rödl, Vojtěch; Schacht, Mathias
21
2009
Almost all hypergraphs without Fano planes are bipartite. Zbl 1423.05114
Person, Yury; Schacht, Mathias
12
2009
Hypergraph regularity and quasi-randomness. Zbl 1425.05103
Nagle, Brendan; Poerschke, Annika; Rödl, Vojtěch; Schacht, Mathias
6
2009
An expected polynomial time algorithm for coloring 2-colorable 3-graphs. Zbl 1273.05223
Person, Yury; Schacht, Mathias
3
2009
Note on strong refutation algorithms for random \(k\)-SAT formulas. Zbl 1268.68085
Hàn, Hiệp; Person, Yury; Schacht, Mathias
1
2009
On the Ramsey number of sparse 3-graphs. Zbl 1169.05024
Nagle, Brendan; Olsen, Sayaka; Rödl, Vojtěch; Schacht, Mathias
15
2008
Spanning 3-colourable subgraphs of small bandwidth in dense graphs. Zbl 1149.05021
Böttcher, Julia; Schacht, Mathias; Taraz, Anusch
10
2008
A note on perfect matchings in uniform hypergraphs with large minimum collective degree. Zbl 1212.05215
Rödl, Vojtěch; Ruciński, Andrzej; Schacht, Mathias; Szemerédi, Endre
6
2008
Note on the 3-graph counting Lemma. Zbl 1169.05028
Nagle, Brendan; Rödl, Vojtěch; Schacht, Mathias
2
2008
Regular partitions of hypergraphs: regularity lemmas. Zbl 1206.05071
Rödl, Vojtěch; Schacht, Mathias
52
2007
Regular partitions of hypergraphs: counting lemmas. Zbl 1206.05072
Rödl, Vojtěch; Schacht, Mathias
29
2007
Ramsey properties of random \(k\)-partite, \(k\)-uniform hypergraphs. Zbl 1140.05043
Rödl, Vojtěch; Ruciński, Andrzej; Schacht, Mathias
13
2007
Turán’s theorem for pseudo-random graphs. Zbl 1120.05084
Kohayakawa, Yoshiharu; Rödl, Vojtěch; Schacht, Mathias; Sissokho, Papa; Skokan, Jozef
8
2007
Property testing in hypergraphs and the removal lemma. Zbl 1232.68174
Rödl, V.; Schacht, M.
8
2007
Integer and fractional packings of hypergraphs. Zbl 1111.05082
Rödl, V.; Schacht, M.; Siggers, M. H.; Tokushige, N.
6
2007
Every monotone 3-graph property is testable. Zbl 1142.68053
Avart, Christian; Rödl, Vojtěch; Schacht, Mathias
4
2007
The counting lemma for regular \(k\)-uniform hypergraphs. Zbl 1093.05045
Nagle, Brendan; Rödl, Vojtěch; Schacht, Mathias
88
2006
Extremal hypergraph problems and the regularity method. Zbl 1116.05041
Nagle, Brendan; Rödl, Vojtěch; Schacht, Mathias
18
2006
On six problems posed by Jarik Nešetřil. Zbl 1116.05081
Bang-Jensen, Jørgen; Reed, Bruce; Schacht, Mathias; Šámal, Robert; Toft, Bjarne; Wagner, Uli
11
2006
Density theorems and extremal hypergraph problems. Zbl 1127.05055
Rödl, V.; Schacht, M.; Tengan, E.; Tokushige, N.
8
2006
The hypergraph regularity method and its applications. Zbl 1135.05307
Rödl, V.; Nagle, B.; Skokan, J.; Schacht, M.; Kohayakawa, Y.
12
2005
The Turán theorem for random graphs. Zbl 1048.05075
Kohayakawa, Yoshiharu; Rödl, Vojtěch; Schacht, Mathias
16
2004
all top 5

Cited by 567 Authors

45 Schacht, Mathias
36 Kohayakawa, Yoshiharu
33 Rodl, Vojtech
31 Han, Jie
27 Sudakov, Benny
22 Böttcher, Julia
21 Conlon, David
19 Balogh, József
19 Mota, Guilherme Oliveira
18 Fox, Jacob
18 Zhao, Yi
17 Person, Yury Aleksandrovic
16 Hàn, Hiệp
16 Shapira, Asaf
16 Taraz, Anusch
15 Aigner-Horev, Elad
15 Samotij, Wojciech
15 Treglown, Andrew
14 Kühn, Daniela
14 Mubayi, Dhruv
14 Nenadov, Rajko
14 Osthus, Deryk
13 Ruciński, Andrzej
12 Hoppen, Carlos
12 Lefmann, Hanno
12 Mycroft, Richard
12 Reiher, Christian
11 Joos, Felix Claudius
11 Pikhurko, Oleg
11 Zhao, Yufei
10 Krivelevich, Michael
10 Steger, Angelika
9 Alon, Noga
9 Nagle, Brendan
9 Skokan, Jozef
9 Tao, Terence
8 Bolla, Marianna
8 Cooley, Oliver
8 Hladký, Jan
8 Wang, Guanghui
7 Keevash, Peter
7 Lu, Mei
7 Morris, Patrick W.
7 Staden, Katherine
6 Falgas-Ravry, Victor
6 Kim, Jaehoon
6 Lee, Choongbum
6 Lee, Joonkyung
6 Lenz, John
6 Lin, Qizhong
6 Lo, Allan Siu Lun
6 Lu, Hongliang
6 Morris, Robert D.
6 Škorić, Nemanja
6 Szemerédi, Endre
6 Zhang, Yi
5 Bhattacharyya, Arnab
5 Bucić, Matija
5 Das, Shagnik
5 Dellamonica, Domingos jun.
5 Dujmović, Vida
5 Ferber, Asaf
5 Gerbner, Dániel
5 Glock, Stefan
5 Hancock, Robert
5 Hefetz, Dan
5 Král’, Daniel
5 Odermann, Knut
5 Piguet, Diana
5 Schnitzer, Jakob
5 Schülke, Bjarne
4 Clemen, Felix Christian
4 Dudek, Andrzej
4 Ehard, Stefan
4 Gowers, William Timothy
4 Janzer, Oliver
4 Kwan, Matthew
4 Lang, Richard
4 Li, Yusheng
4 Markström, Klas
4 Morin, Pat
4 Mousset, Frank
4 Narayanan, Bhargav P.
4 Parczyk, Olaf
4 Pokrovskiy, Alexey
4 Sanhueza-Matamala, Nicolás
4 Saxton, David
4 Schulenburg, Fabian
4 Serra, Oriol
4 Shangguan, Chong
4 Towsner, Henry
4 Trujić, Miloš
4 Tyomkyn, Mykhaylo
4 Vena, Lluís
4 Warnke, Lutz
4 You, Chunlin
4 Yuster, Raphael
4 Zhou, Wenling
3 Antoniuk, Sylwia
3 Austin, Tim D.
...and 467 more Authors
all top 5

Cited in 80 Serials

59 Random Structures & Algorithms
52 Journal of Combinatorial Theory. Series B
44 SIAM Journal on Discrete Mathematics
40 Combinatorics, Probability and Computing
33 European Journal of Combinatorics
31 The Electronic Journal of Combinatorics
26 Journal of Combinatorial Theory. Series A
24 Discrete Mathematics
23 Journal of Graph Theory
19 Combinatorica
17 Israel Journal of Mathematics
14 Graphs and Combinatorics
13 Advances in Mathematics
10 Discrete Applied Mathematics
10 Journal of the London Mathematical Society. Second Series
9 Forum of Mathematics, Sigma
7 Transactions of the American Mathematical Society
7 Geometric and Functional Analysis. GAFA
6 Bulletin of the London Mathematical Society
6 Discrete & Computational Geometry
6 Discrete Analysis
5 Proceedings of the American Mathematical Society
4 Mathematical Proceedings of the Cambridge Philosophical Society
4 Acta Mathematica Hungarica
4 Linear Algebra and its Applications
4 Annals of Mathematics. Second Series
4 Journal of the European Mathematical Society (JEMS)
3 SIAM Journal on Computing
3 Bulletin of the American Mathematical Society. New Series
3 Annals of Combinatorics
2 Journal d’Analyse Mathématique
2 Compositio Mathematica
2 Memoirs of the American Mathematical Society
2 Acta Mathematicae Applicatae Sinica. English Series
2 Journal of the American Mathematical Society
2 Discussiones Mathematicae. Graph Theory
2 International Journal of Combinatorics
2 Special Matrices
1 American Mathematical Monthly
1 Communications on Pure and Applied Mathematics
1 International Journal of Theoretical Physics
1 Jahresbericht der Deutschen Mathematiker-Vereinigung (DMV)
1 Nonlinearity
1 Russian Mathematical Surveys
1 The Annals of Probability
1 Czechoslovak Mathematical Journal
1 Duke Mathematical Journal
1 Inventiones Mathematicae
1 Journal of Computer and System Sciences
1 Journal of Functional Analysis
1 Journal of Number Theory
1 The Journal of Symbolic Logic
1 Mathematische Annalen
1 Proceedings of the London Mathematical Society. Third Series
1 Theoretical Computer Science
1 Advances in Applied Mathematics
1 Ergodic Theory and Dynamical Systems
1 Annals of Pure and Applied Logic
1 Order
1 Algorithmica
1 Journal of Automated Reasoning
1 Journal of Theoretical Probability
1 Computational Geometry
1 International Journal of Foundations of Computer Science
1 IMRN. International Mathematics Research Notices
1 Proceedings of the National Academy of Sciences of the United States of America
1 SIAM Review
1 The Australasian Journal of Combinatorics
1 Computational Complexity
1 Mathematical Logic Quarterly (MLQ)
1 Electronic Journal of Probability
1 Journal of Combinatorial Optimization
1 Acta Mathematica Sinica. English Series
1 Contributions to Discrete Mathematics
1 Discrete Mathematics, Algorithms and Applications
1 Acta Universitatis Sapientiae. Informatica
1 The Review of Symbolic Logic
1 Forum of Mathematics, Pi
1 Communications in Mathematics and Statistics
1 Computer Science Review

Citations by Year

The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.