Mathias Schacht

82 papers A* 6A 1C 2Journal 72

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	The codegree Turán density of 3-uniform tight cycles. J. Comb. Theory B Simón Piga, Nicolás Sanhueza-Matamala, Mathias Schacht
2024	J	`jnl`	Equivalent regular partitions of three-uniform hypergraphs. Random Struct. Algorithms Brendan Nagle, Vojtech Rödl, Mathias Schacht
2024	A	`conf`	Ramsey Properties of Randomly Perturbed Hypergraphs. APPROX/RANDOM Elad Aigner-Horev, Dan Hefetz, Mathias Schacht
2023	C	`conf`	Canonical colourings in random graphs. LAGOS Nina Kamcev, Mathias Schacht
2022	J	`jnl`	Localized Codegree Conditions for Tight Hamilton Cycles in 3-Uniform Hypergraphs. SIAM J. Discret. Math. Pedro Araújo, Simón Piga, Mathias Schacht
2021	J	`jnl`	Finding tight Hamilton cycles in random hypergraphs faster. Comb. Probab. Comput. Deepak Bal, Ross Berkowitz, Pat Devlin, Mathias Schacht
2021	J	`jnl`	Hamiltonian Berge cycles in random hypergraphs. Comb. Probab. Comput. Deepak Bal, Ross Berkowitz, Pat Devlin, Mathias Schacht
2021	J	`jnl`	High powers of Hamiltonian cycles in randomly augmented graphs. J. Graph Theory Sylwia Antoniuk, Andrzej Dudek, Christian Reiher, Andrzej Rucinski, Mathias Schacht
2021	J	`jnl`	On the size-Ramsey number of grid graphs. Comb. Probab. Comput. Dennis Clemens, Meysam Miralaei, Damian Reding, Mathias Schacht, Anusch Taraz
2021	J	`jnl`	Ramsey-type numbers involving graphs and hypergraphs with large girth. Comb. Probab. Comput. Hiêp Hàn, Troy Retter, Vojtech Rödl, Mathias Schacht
2021	C	`conf`	Turán density of cliques of order five in 3-uniform hypergraphs with quasirandom links. LAGOS Sören Berger, Simón Piga, Christian Reiher, Vojtech Rödl, Mathias Schacht
2020	J	`jnl`	Embedding spanning subgraphs in uniformly dense and inseparable graphs. Random Struct. Algorithms Oliver Ebsen, Giulia S. Maesaka, Christian Reiher, Mathias Schacht, Bjarne Schülke
2020	J	`jnl`	Homomorphism Thresholds for Odd Cycles. Comb. Oliver Ebsen, Mathias Schacht
2020	J	`jnl`	On the structure of Dense graphs with bounded clique number. Comb. Probab. Comput. Heiner Oberkampf, Mathias Schacht
2020	J	`jnl`	Powers of Hamiltonian cycles in randomly augmented graphs. Random Struct. Algorithms Andrzej Dudek, Christian Reiher, Andrzej Rucinski, Mathias Schacht
2020	J	`jnl`	Sharp thresholds for nonlinear Hamiltonian cycles in hypergraphs. Random Struct. Algorithms Bhargav P. Narayanan, Mathias Schacht
2019	J	`jnl`	On the local density problem for graphs of given odd-girth. J. Graph Theory Wiebke Bedenknecht, Guilherme Oliveira Mota, Christian Reiher, Mathias Schacht
2018	J	`jnl`	An algorithmic hypergraph regularity lemma. Random Struct. Algorithms Brendan Nagle, Vojtech Rödl, Mathias Schacht
2018	J	`jnl`	Hypergraphs with vanishing Turán density in uniformly dense hypergraphs. J. Lond. Math. Soc. Christian Reiher, Vojtech Rödl, Mathias Schacht
2018	J	`jnl`	Loose Hamiltonian cycles forced by large (k-2)-degree - sharp version. Contributions Discret. Math. Josefran de Oliveira Bastos, Guilherme Oliveira Mota, Mathias Schacht, Jakob Schnitzer, Fabian Schulenburg
2018	J	`jnl`	Quasirandomness in Hypergraphs. Electron. J. Comb. Elad Aigner-Horev, David Conlon, Hiêp Hàn, Yury Person, Mathias Schacht
2018	J	`jnl`	Sharp thresholds for Ramsey properties of strictly balanced nearly bipartite graphs. Random Struct. Algorithms Mathias Schacht, Fabian Schulenburg
2017	J	`jnl`	An exponential-type upper bound for Folkman numbers. Comb. Vojtech Rödl, Andrzej Rucinski, Mathias Schacht
2017	J	`jnl`	Counting results for sparse pseudorandom hypergraphs I. Eur. J. Comb. Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Mathias Schacht, Anusch Taraz
2017	J	`jnl`	Counting results for sparse pseudorandom hypergraphs II. Eur. J. Comb. Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Mathias Schacht, Anusch Taraz
2017	J	`jnl`	Loose Hamiltonian Cycles Forced by Large (k-2)-Degree - Approximate Version. SIAM J. Discret. Math. Josefran de Oliveira Bastos, Guilherme Oliveira Mota, Mathias Schacht, Jakob Schnitzer, Fabian Schulenburg
2017	J	`jnl`	Loose Hamiltonian cycles forced by large (k - 2)-degree - sharp version. Electron. Notes Discret. Math. Josefran de Oliveira Bastos, Guilherme Oliveira Mota, Mathias Schacht, Jakob Schnitzer, Fabian Schulenburg
2017	J	`jnl`	Monochromatic trees in random graphs. Electron. Notes Discret. Math. Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Mathias Schacht
2017	J	`jnl`	On the local density problem for graphs of given odd-girth. Electron. Notes Discret. Math. Wiebke Bedenknecht, Guilherme Oliveira Mota, Christian Reiher, Mathias Schacht
2017	J	`jnl`	Quasirandomness in hypergraphs. Electron. Notes Discret. Math. Elad Aigner-Horev, David Conlon, Hiêp Hàn, Yury Person, Mathias Schacht
2017	J	`jnl`	Ramsey properties of random graphs and Folkman numbers. Discuss. Math. Graph Theory Vojtech Rödl, Andrzej Rucinski, Mathias Schacht
2016	A*	`conf`	An Algorithmic Hypergraph Regularity Lemma. SODA Brendan Nagle, Vojtech Rödl, Mathias Schacht
2016	J	`jnl`	Embedding tetrahedra into quasirandom hypergraphs. J. Comb. Theory B Christian Reiher, Vojtech Rödl, Mathias Schacht
2016	J	`jnl`	Loose Hamiltonian cycles forced by (k - 2)-degree - approximate version. Electron. Notes Discret. Math. Josefran de Oliveira Bastos, Guilherme Oliveira Mota, Mathias Schacht, Jakob Schnitzer, Fabian Schulenburg
2016	J	`jnl`	Packing minor-closed families of graphs into complete graphs. J. Comb. Theory B Silvia Messuti, Vojtech Rödl, Mathias Schacht
2015	J	`jnl`	A counting lemma for sparse pseudorandom hypergraphs. Electron. Notes Discret. Math. Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Mathias Schacht, Anusch Taraz
2015	J	`jnl`	On the Structure of Graphs with Given Odd Girth and Large Minimum Degree. J. Graph Theory Silvia Messuti, Mathias Schacht
2015	J	`jnl`	Packing minor closed families of graphs. Electron. Notes Discret. Math. Silvia Messuti, Vojtech Rödl, Mathias Schacht
2015	J	`jnl`	Ramsey numbers for bipartite graphs with small bandwidth. Eur. J. Comb. Guilherme Oliveira Mota, Gábor N. Sárközy, Mathias Schacht, Anusch Taraz
2015	J	`jnl`	Ramsey-type numbers involving graphs and hypergraphs with large girth. Electron. Notes Discret. Math. Hiêp Hàn, Troy Retter, Vojtech Rödl, Mathias Schacht
2014	J	`jnl`	Extremal results for odd cycles in sparse pseudorandom graphs. Comb. Elad Aigner-Horev, Hiêp Hàn, Mathias Schacht
2014	J	`jnl`	Upper bounds on probability thresholds for asymmetric Ramsey properties. Random Struct. Algorithms Yoshiharu Kohayakawa, Mathias Schacht, Reto Spöhel
2013	J	`jnl`	Extremal results for odd cycles in sparse pseudorandom graphs. Electron. Notes Discret. Math. Elad Aigner-Horev, Hiêp Hàn, Mathias Schacht
2013	J	`jnl`	Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs. J. Comb. Theory B Enno Buß, Hiêp Hàn, Mathias Schacht
2012	J	`jnl`	Complete Partite subgraphs in dense hypergraphs. Random Struct. Algorithms Vojtech Rödl, Mathias Schacht
2012	J	`jnl`	On Even-Degree Subgraphs of Linear Hypergraphs. Comb. Probab. Comput. Domingos Dellamonica Jr., Penny E. Haxell, Tomasz Luczak, Dhruv Mubayi, Brendan Nagle, Yury Person, Vojtech Rödl, Mathias Schacht, Jacques Verstraëte
2012	J	`jnl`	Weak quasi-randomness for uniform hypergraphs. Random Struct. Algorithms David Conlon, Hiêp Hàn, Yury Person, Mathias Schacht
2011	J	`jnl`	An expected polynomial time algorithm for coloring 2-colorable 3-graphs. Discret. Math. Theor. Comput. Sci. Yury Person, Mathias Schacht
2011	J	`jnl`	Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs. Electron. Notes Discret. Math. Enno Buß, Hiêp Hàn, Mathias Schacht
2011	J	`jnl`	Note on forcing pairs. Electron. Notes Discret. Math. Hiêp Hàn, Yury Person, Mathias Schacht
2011	J	`jnl`	Untangling planar graphs from a specified vertex position - Hard cases. Discret. Appl. Math. Mihyun Kang, Oleg Pikhurko, Alexander Ravsky, Mathias Schacht, Oleg Verbitsky
2010	J	`jnl`	Dirac-type results for loose Hamilton cycles in uniform hypergraphs. J. Comb. Theory B Hiêp Hàn, Mathias Schacht
2010	J	`jnl`	Note on Bipartite Graph Tilings. SIAM J. Discret. Math. Jan Hladký, Mathias Schacht
2010	J	`jnl`	Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions. SIAM J. Comput. Noga Alon, Amin Coja-Oghlan, Hiêp Hàn, Mihyun Kang, Vojtech Rödl, Mathias Schacht
2010	J	`jnl`	Ramsey properties of random discrete structures. Random Struct. Algorithms Ehud Friedgut, Vojtech Rödl, Mathias Schacht
2010	—	`—`	Regular partitions of hypergraphs and property testing Mathias Schacht
2010	J	`jnl`	Weak hypergraph regularity and linear hypergraphs. J. Comb. Theory B Yoshiharu Kohayakawa, Brendan Nagle, Vojtech Rödl, Mathias Schacht
2009	A*	`conf`	Almost all hypergraphs without Fano planes are bipartite. SODA Yury Person, Mathias Schacht
2009	J	`jnl`	An expected polynomial time algorithm for coloring 2-colorable 3-graphs. Electron. Notes Discret. Math. Yury Person, Mathias Schacht
2009	J	`jnl`	Generalizations of the removal lemma. Comb. Vojtech Rödl, Mathias Schacht
2009	A*	`conf`	Hypergraph regularity and quasi-randomness. SODA Brendan Nagle, Annika Poerschke, Vojtech Rödl, Mathias Schacht
2009	J	`jnl`	Note on strong refutation algorithms for random k-SAT formulas. Electron. Notes Discret. Math. Hiêp Hàn, Yury Person, Mathias Schacht
2009	J	`jnl`	On Colourings of Hypergraphs Without Monochromatic Fano Planes. Comb. Probab. Comput. Hanno Lefmann, Yury Person, Vojtech Rödl, Mathias Schacht
2009	J	`jnl`	On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree. SIAM J. Discret. Math. Hiêp Hàn, Yury Person, Mathias Schacht
2008	J	`jnl`	Note on the 3-graph counting lemma. Discret. Math. Brendan Nagle, Vojtech Rödl, Mathias Schacht
2008	J	`jnl`	Obfuscated Drawings of Planar Graphs CoRR Mihyun Kang, Oleg Pikhurko, Alexander Ravsky, Mathias Schacht, Oleg Verbitsky
2008	J	`jnl`	On the Ramsey Number of Sparse 3-Graphs. Graphs Comb. Brendan Nagle, Sayaka Olsen, Vojtech Rödl, Mathias Schacht
2008	J	`jnl`	Spanning 3-colourable subgraphs of small bandwidth in dense graphs. J. Comb. Theory B Julia Böttcher, Mathias Schacht, Anusch Taraz
2007	J	`jnl`	Embedding spanning subgraphs of small bandwidth. Electron. Notes Discret. Math. Julia Böttcher, Mathias Schacht, Anusch Taraz
2007	J	`jnl`	Every Monotone 3-Graph Property is Testable. SIAM J. Discret. Math. Christian Avart, Vojtech Rödl, Mathias Schacht
2007	J	`jnl`	Integer and fractional packings of hypergraphs. J. Comb. Theory B Vojtech Rödl, Mathias Schacht, Mark H. Siggers, Norihide Tokushige
2007	A*	`conf`	On the bandwidth conjecture for 3-colourable graphs. SODA Julia Böttcher, Mathias Schacht, Anusch Taraz
2007	A*	`conf`	Property testing in hypergraphs and the removal lemma. STOC Vojtech Rödl, Mathias Schacht
2007	A*	`conf`	Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions. ICALP Noga Alon, Amin Coja-Oghlan, Hiêp Hàn, Mihyun Kang, Vojtech Rödl, Mathias Schacht
2007	J	`jnl`	Ramsey Properties of Random k-Partite, k-Uniform Hypergraphs. SIAM J. Discret. Math. Vojtech Rödl, Andrzej Rucinski, Mathias Schacht
2007	J	`jnl`	Regular Partitions of Hypergraphs: Counting Lemmas. Comb. Probab. Comput. Vojtech Rödl, Mathias Schacht
2007	J	`jnl`	Regular Partitions of Hypergraphs: Regularity Lemmas. Comb. Probab. Comput. Vojtech Rödl, Mathias Schacht
2007	J	`jnl`	Turán's theorem for pseudo-random graphs. J. Comb. Theory A Yoshiharu Kohayakawa, Vojtech Rödl, Mathias Schacht, Papa A. Sissokho, Jozef Skokan
2006	J	`jnl`	The counting lemma for regular Random Struct. Algorithms Brendan Nagle, Vojtech Rödl, Mathias Schacht
2005	J	`jnl`	Every Monotone 3-Graph Property is Testable. Electron. Notes Discret. Math. Christian Avart, Vojtech Rödl, Mathias Schacht
2005	J	`jnl`	Globally bounded local edge colourings of hypergraphs. Electron. Notes Discret. Math. Mathias Schacht, Anusch Taraz
2004	J	`jnl`	The Turán Theorem for Random Graphs. Comb. Probab. Comput. Yoshiharu Kohayakawa, Vojtech Rödl, Mathias Schacht