default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathias Schacht
Person information
- affiliation: University of Hamburg, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2010
[b1]Mathias Schacht:
Regular partitions of hypergraphs and property testing. HU Berlin, Germany, 2010
Journal Articles
- 2022
- [j69]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): 147-169 (2022) - 2021
- [j68]Deepak Bal, Ross Berkowitz, Pat Devlin, Mathias Schacht:
Hamiltonian Berge cycles in random hypergraphs. Comb. Probab. Comput. 30(2): 228-238 (2021) - [j67]Deepak Bal, Ross Berkowitz, Pat Devlin, Mathias Schacht:
Finding tight Hamilton cycles in random hypergraphs faster. Comb. Probab. Comput. 30(2): 239-257 (2021) - [j66]Dennis Clemens, Meysam Miralaei, Damian Reding, Mathias Schacht, Anusch Taraz:
On the size-Ramsey number of grid graphs. Comb. Probab. Comput. 30(5): 670-685 (2021) - [j65]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): 722-740 (2021) - [j64]Sylwia Antoniuk, Andrzej Dudek, Christian Reiher, Andrzej Rucinski, Mathias Schacht:
High powers of Hamiltonian cycles in randomly augmented graphs. J. Graph Theory 98(2): 255-284 (2021) - 2020
- [j63]Oliver Ebsen, Mathias Schacht:
Homomorphism Thresholds for Odd Cycles. Comb. 40(1): 39-62 (2020) - [j62]Heiner Oberkampf, Mathias Schacht:
On the structure of Dense graphs with bounded clique number. Comb. Probab. Comput. 29(5): 641-649 (2020) - [j61]Andrzej Dudek, Christian Reiher, Andrzej Rucinski, Mathias Schacht:
Powers of Hamiltonian cycles in randomly augmented graphs. Random Struct. Algorithms 56(1): 122-141 (2020) - [j60]Bhargav P. Narayanan, Mathias Schacht:
Sharp thresholds for nonlinear Hamiltonian cycles in hypergraphs. Random Struct. Algorithms 57(1): 244-255 (2020) - [j59]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): 1077-1096 (2020) - 2019
- [j58]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): 137-149 (2019) - 2018
- [j57]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) - [j56]Elad Aigner-Horev, David Conlon, Hiêp Hàn, Yury Person, Mathias Schacht:
Quasirandomness in Hypergraphs. Electron. J. Comb. 25(3): 3 (2018) - [j55]Christian Reiher, Vojtech Rödl, Mathias Schacht:
Hypergraphs with vanishing Turán density in uniformly dense hypergraphs. J. Lond. Math. Soc. 97(1): 77-97 (2018) - [j54]Mathias Schacht, Fabian Schulenburg:
Sharp thresholds for Ramsey properties of strictly balanced nearly bipartite graphs. Random Struct. Algorithms 52(1): 3-40 (2018) - [j53]Brendan Nagle, Vojtech Rödl, Mathias Schacht:
An algorithmic hypergraph regularity lemma. Random Struct. Algorithms 52(2): 301-353 (2018) - 2017
- [j52]Vojtech Rödl, Andrzej Rucinski, Mathias Schacht:
An exponential-type upper bound for Folkman numbers. Comb. 37(4): 767-784 (2017) - [j51]Vojtech Rödl, Andrzej Rucinski, Mathias Schacht:
Ramsey properties of random graphs and Folkman numbers. Discuss. Math. Graph Theory 37(3): 755-776 (2017) - [j50]Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Mathias Schacht, Anusch Taraz:
Counting results for sparse pseudorandom hypergraphs I. Eur. J. Comb. 65: 276-287 (2017) - [j49]Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Mathias Schacht, Anusch Taraz:
Counting results for sparse pseudorandom hypergraphs II. Eur. J. Comb. 65: 288-301 (2017) - [j48]Elad Aigner-Horev, David Conlon, Hiêp Hàn, Yury Person, Mathias Schacht:
Quasirandomness in hypergraphs. Electron. Notes Discret. Math. 61: 13-19 (2017) - [j47]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: 101-106 (2017) - [j46]Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Mathias Schacht:
Monochromatic trees in random graphs. Electron. Notes Discret. Math. 61: 759-764 (2017) - [j45]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: 39-44 (2017) - [j44]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): 2328-2347 (2017) - 2016
- [j43]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: 325-330 (2016) - [j42]Silvia Messuti, Vojtech Rödl, Mathias Schacht:
Packing minor-closed families of graphs into complete graphs. J. Comb. Theory B 119: 245-265 (2016) - [j41]Christian Reiher, Vojtech Rödl, Mathias Schacht:
Embedding tetrahedra into quasirandom hypergraphs. J. Comb. Theory B 121: 229-247 (2016) - 2015
- [j40]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: 165-176 (2015) - [j39]Silvia Messuti, Vojtech Rödl, Mathias Schacht:
Packing minor closed families of graphs. Electron. Notes Discret. Math. 49: 651-659 (2015) - [j38]Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Mathias Schacht, Anusch Taraz:
A counting lemma for sparse pseudorandom hypergraphs. Electron. Notes Discret. Math. 50: 421-426 (2015) - [j37]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: 457-463 (2015) - [j36]Silvia Messuti, Mathias Schacht:
On the Structure of Graphs with Given Odd Girth and Large Minimum Degree. J. Graph Theory 80(1): 69-81 (2015) - 2014
- [j35]Elad Aigner-Horev, Hiêp Hàn, Mathias Schacht:
Extremal results for odd cycles in sparse pseudorandom graphs. Comb. 34(4): 379-406 (2014) - [j34]Yoshiharu Kohayakawa, Mathias Schacht, Reto Spöhel:
Upper bounds on probability thresholds for asymmetric Ramsey properties. Random Struct. Algorithms 44(1): 1-28 (2014) - 2013
- [j33]Elad Aigner-Horev, Hiêp Hàn, Mathias Schacht:
Extremal results for odd cycles in sparse pseudorandom graphs. Electron. Notes Discret. Math. 44: 385-391 (2013) - [j32]Enno Buß, Hiêp Hàn, Mathias Schacht:
Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs. J. Comb. Theory B 103(6): 658-678 (2013) - 2012
- [j31]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): 113-127 (2012) - [j30]David Conlon, Hiêp Hàn, Yury Person, Mathias Schacht:
Weak quasi-randomness for uniform hypergraphs. Random Struct. Algorithms 40(1): 1-38 (2012) - [j29]Vojtech Rödl, Mathias Schacht:
Complete Partite subgraphs in dense hypergraphs. Random Struct. Algorithms 41(4): 557-573 (2012) - 2011
- [j28]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): 789-799 (2011) - [j27]Yury Person, Mathias Schacht:
An expected polynomial time algorithm for coloring 2-colorable 3-graphs. Discret. Math. Theor. Comput. Sci. 13(2): 1-18 (2011) - [j26]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: 207-212 (2011) - [j25]Hiêp Hàn, Yury Person, Mathias Schacht:
Note on forcing pairs. Electron. Notes Discret. Math. 38: 437-442 (2011) - 2010
- [j24]Yoshiharu Kohayakawa, Brendan Nagle, Vojtech Rödl, Mathias Schacht:
Weak hypergraph regularity and linear hypergraphs. J. Comb. Theory B 100(2): 151-160 (2010) - [j23]Hiêp Hàn, Mathias Schacht:
Dirac-type results for loose Hamilton cycles in uniform hypergraphs. J. Comb. Theory B 100(3): 332-346 (2010) - [j22]Ehud Friedgut, Vojtech Rödl, Mathias Schacht:
Ramsey properties of random discrete structures. Random Struct. Algorithms 37(4): 407-436 (2010) - [j21]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): 2336-2362 (2010) - [j20]Jan Hladký, Mathias Schacht:
Note on Bipartite Graph Tilings. SIAM J. Discret. Math. 24(2): 357-362 (2010) - 2009
- [j19]Vojtech Rödl, Mathias Schacht:
Generalizations of the removal lemma. Comb. 29(4): 467-501 (2009) - [j18]Hanno Lefmann, Yury Person, Vojtech Rödl, Mathias Schacht:
On Colourings of Hypergraphs Without Monochromatic Fano Planes. Comb. Probab. Comput. 18(5): 803-818 (2009) - [j17]Yury Person, Mathias Schacht:
An expected polynomial time algorithm for coloring 2-colorable 3-graphs. Electron. Notes Discret. Math. 34: 465-469 (2009) - [j16]Hiêp Hàn, Yury Person, Mathias Schacht:
Note on strong refutation algorithms for random k-SAT formulas. Electron. Notes Discret. Math. 35: 157-162 (2009) - [j15]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): 732-748 (2009) - 2008
- [j14]Brendan Nagle, Vojtech Rödl, Mathias Schacht:
Note on the 3-graph counting lemma. Discret. Math. 308(19): 4501-4517 (2008) - [j13]Brendan Nagle, Sayaka Olsen, Vojtech Rödl, Mathias Schacht:
On the Ramsey Number of Sparse 3-Graphs. Graphs Comb. 24(3): 205-228 (2008) - [j12]Julia Böttcher, Mathias Schacht, Anusch Taraz:
Spanning 3-colourable subgraphs of small bandwidth in dense graphs. J. Comb. Theory B 98(4): 752-777 (2008) - 2007
- [j11]Vojtech Rödl, Mathias Schacht:
Regular Partitions of Hypergraphs: Regularity Lemmas. Comb. Probab. Comput. 16(6): 833-885 (2007) - [j10]Vojtech Rödl, Mathias Schacht:
Regular Partitions of Hypergraphs: Counting Lemmas. Comb. Probab. Comput. 16(6): 887-901 (2007) - [j9]Julia Böttcher, Mathias Schacht, Anusch Taraz:
Embedding spanning subgraphs of small bandwidth. Electron. Notes Discret. Math. 29: 485-489 (2007) - [j8]Vojtech Rödl, Mathias Schacht, Mark H. Siggers, Norihide Tokushige:
Integer and fractional packings of hypergraphs. J. Comb. Theory B 97(2): 245-268 (2007) - [j7]Yoshiharu Kohayakawa, Vojtech Rödl, Mathias Schacht, Papa A. Sissokho, Jozef Skokan:
Turán's theorem for pseudo-random graphs. J. Comb. Theory A 114(4): 631-657 (2007) - [j6]Christian Avart, Vojtech Rödl, Mathias Schacht:
Every Monotone 3-Graph Property is Testable. SIAM J. Discret. Math. 21(1): 73-92 (2007) - [j5]Vojtech Rödl, Andrzej Rucinski, Mathias Schacht:
Ramsey Properties of Random k-Partite, k-Uniform Hypergraphs. SIAM J. Discret. Math. 21(2): 442-460 (2007) - 2006
- [j4]Brendan Nagle, Vojtech Rödl, Mathias Schacht:
The counting lemma for regular k-uniform hypergraphs. Random Struct. Algorithms 28(2): 113-179 (2006) - 2005
- [j3]Mathias Schacht, Anusch Taraz:
Globally bounded local edge colourings of hypergraphs. Electron. Notes Discret. Math. 19: 179-185 (2005) - [j2]Christian Avart, Vojtech Rödl, Mathias Schacht:
Every Monotone 3-Graph Property is Testable. Electron. Notes Discret. Math. 22: 539-542 (2005) - 2004
- [j1]Yoshiharu Kohayakawa, Vojtech Rödl, Mathias Schacht:
The Turán Theorem for Random Graphs. Comb. Probab. Comput. 13(1): 61-91 (2004)
Conference and Workshop Papers
- 2024
- [c9]Elad Aigner-Horev, Dan Hefetz, Mathias Schacht:
Ramsey Properties of Randomly Perturbed Hypergraphs. APPROX/RANDOM 2024: 59:1-59:18 - 2023
- [c8]Nina Kamcev, Mathias Schacht:
Canonical colourings in random graphs. LAGOS 2023: 5-12 - 2021
- [c7]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: 412-418 - 2016
- [c6]Brendan Nagle, Vojtech Rödl, Mathias Schacht:
An Algorithmic Hypergraph Regularity Lemma. SODA 2016: 1765-1773 - 2009
- [c5]Yury Person, Mathias Schacht:
Almost all hypergraphs without Fano planes are bipartite. SODA 2009: 217-226 - [c4]Brendan Nagle, Annika Poerschke, Vojtech Rödl, Mathias Schacht:
Hypergraph regularity and quasi-randomness. SODA 2009: 227-235 - 2007
- [c3]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: 789-800 - [c2]Julia Böttcher, Mathias Schacht, Anusch Taraz:
On the bandwidth conjecture for 3-colourable graphs. SODA 2007: 618-626 - [c1]Vojtech Rödl, Mathias Schacht:
Property testing in hypergraphs and the removal lemma. STOC 2007: 488-495
Informal and Other Publications
- 2008
- [i1]Mihyun Kang, Oleg Pikhurko, Alexander Ravsky, Mathias Schacht, Oleg Verbitsky:
Obfuscated Drawings of Planar Graphs. CoRR abs/0803.0858 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
