Mathias Schacht

发表

Extremal results for odd cycles in sparse pseudorandom graphs

Elad Aigner-Horev, Hiêp Hàn, Mathias Schacht, 2013, Comb..

Counting results for sparse pseudorandom hypergraphs II

Yoshiharu Kohayakawa, Mathias Schacht, Guilherme Oliveira Mota, 2016, Eur. J. Comb..

An expected polynomial time algorithm for coloring 2-colorable 3-graphs

Mathias Schacht, Yury Person, 2011, Discret. Math. Theor. Comput. Sci..

Regular Partitions of Hypergraphs: Regularity Lemmas

Vojtech Rödl, Mathias Schacht, V. Rödl, 2007, Combinatorics, Probability and Computing.

Ramsey properties of random discrete structures

Vojtech Rödl, Mathias Schacht, Ehud Friedgut, 2010, Random Struct. Algorithms.

Loose Hamiltonian Cycles Forced by Large (k-2)-Degree - Approximate Version

Guilherme Oliveira Mota, Mathias Schacht, Josefran de Oliveira Bastos, 2017, SIAM J. Discret. Math..

Homomorphism Thresholds for Odd Cycles

Mathias Schacht, Oliver Ebsen, M. Schacht, 2017, Comb..

Extremal results for odd cycles in sparse pseudorandom graphs

Elad Aigner-Horev, Hiêp Hàn, Mathias Schacht, 2013, Electron. Notes Discret. Math..

The Turán Theorem for Random Graphs

Yoshiharu Kohayakawa, Vojtech Rödl, Mathias Schacht, 2004, Comb. Probab. Comput..

On the Structure of Graphs with Given Odd Girth and Large Minimum Degree

Mathias Schacht, Silvia Messuti, M. Schacht, 2015, J. Graph Theory.

Regular Partitions of Hypergraphs: Counting Lemmas

Vojtech Rödl, Mathias Schacht, V. Rödl, 2007, Combinatorics, Probability and Computing.

Weak hypergraph regularity and linear hypergraphs

Yoshiharu Kohayakawa, Vojtech Rödl, Brendan Nagle, 2010, J. Comb. Theory, Ser. B.

Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions

Vojtech Rödl, Noga Alon, Hiêp Hàn, 2007, ICALP.

Globally bounded local edge colourings of hypergraphs

Mathias Schacht, Anusch Taraz, 2005, Electron. Notes Discret. Math..

Ramsey Properties of Random Graphs and Folkman Numbers

Vojtech Rödl, Mathias Schacht, Andrzej Rucinski, 2017, Discuss. Math. Graph Theory.

Quasirandomness in hypergraphs

David Conlon, Elad Aigner-Horev, Hiêp Hàn, 2017, Electron. Notes Discret. Math..

High powers of Hamiltonian cycles in randomly augmented graphs

Andrzej Dudek, Mathias Schacht, Christian Reiher, 2020, J. Graph Theory.

Every Monotone 3-Graph Property is Testable

Vojtech Rödl, Mathias Schacht, Christian Avart, 2005, SIAM J. Discret. Math..

Hypergraph regularity and quasi-randomness

Vojtech Rödl, Brendan Nagle, Mathias Schacht, 2009, SODA.

Upper bounds on probability thresholds for asymmetric Ramsey properties

Yoshiharu Kohayakawa, Mathias Schacht, Reto Spöhel, 2014, Random Struct. Algorithms.

Note on the 3-graph counting lemma

Vojtech Rödl, Brendan Nagle, Mathias Schacht, 2008, Discret. Math..

Ramsey numbers for bipartite graphs with small bandwidth

Guilherme Oliveira Mota, Gábor N. Sárközy, Mathias Schacht, 2015, Eur. J. Comb..

Almost all hypergraphs without Fano planes are bipartite

Mathias Schacht, Yury Person, M. Schacht, 2009, SODA.

On the structure of Dense graphs with bounded clique number

Mathias Schacht, Heiner Oberkampf, M. Schacht, 2016, Combinatorics, Probability and Computing.

Note on Bipartite Graph Tilings

Jan Hladký, Mathias Schacht, M. Schacht, 2008, SIAM J. Discret. Math..

Embedding spanning subgraphs in uniformly dense and inseparable graphs

Mathias Schacht, Christian Reiher, Oliver Ebsen, 2019, Random Struct. Algorithms.

Note on strong refutation algorithms for random k-SAT formulas

Hiêp Hàn, Mathias Schacht, Yury Person, 2009, Electron. Notes Discret. Math..

Embedding tetrahedra into quasirandom hypergraphs

Vojtech Rödl, Mathias Schacht, Christian Reiher, 2016, J. Comb. Theory, Ser. B.

Embedding spanning subgraphs of small bandwidth

Mathias Schacht, Julia Böttcher, Anusch Taraz, 2007, Electron. Notes Discret. Math..

Monochromatic trees in random graphs

Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Mathias Schacht, 2016, Mathematical Proceedings of the Cambridge Philosophical Society.

On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree

Hiêp Hàn, Mathias Schacht, Yury Person, 2009, SIAM J. Discret. Math..

Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs

Hiêp Hàn, Mathias Schacht, Enno Buß, 2011, Electron. Notes Discret. Math..

Counting results for sparse pseudorandom hypergraphs I

Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Mathias Schacht, 2016, Eur. J. Comb..

An exponential-type upper bound for Folkman numbers

Vojtech Rödl, Mathias Schacht, Andrzej Rucinski, 2016, Comb..

On the bandwidth conjecture for 3-colourable graphs

Mathias Schacht, Julia Böttcher, Anusch Taraz, 2007, SODA '07.

Sharp thresholds for nonlinear Hamiltonian cycles in hypergraphs

Mathias Schacht, Bhargav P. Narayanan, Bhargav Narayanan, 2019, Random Struct. Algorithms.

Every Monotone 3-Graph Property is Testable

Vojtech Rödl, Mathias Schacht, Christian Avart, 2007, SIAM J. Discret. Math..

Packing minor closed families of graphs

Vojtech Rödl, Mathias Schacht, Silvia Messuti, 2015, Electron. Notes Discret. Math..

Complete Partite subgraphs in dense hypergraphs

Vojtech Rödl, Mathias Schacht, V. Rödl, 2012, Random Struct. Algorithms.

The counting lemma for regular k‐uniform hypergraphs

Vojtech Rödl, Brendan Nagle, Mathias Schacht, 2006, Random Struct. Algorithms.

Packing minor-closed families of graphs into complete graphs

Vojtech Rödl, Mathias Schacht, Silvia Messuti, 2016, J. Comb. Theory, Ser. B.

Spanning 3-colourable subgraphs of small bandwidth in dense graphs

Mathias Schacht, Julia Böttcher, Anusch Taraz, 2008, J. Comb. Theory, Ser. B.

On the Ramsey Number of Sparse 3-Graphs

Vojtech Rödl, Brendan Nagle, Mathias Schacht, 2008, Graphs Comb..

Obfuscated Drawings of Planar Graphs pdf

Oleg Verbitsky, Mathias Schacht, Oleg Pikhurko, 2008, ArXiv.

Turán's theorem for pseudo-random graphs

Yoshiharu Kohayakawa, Vojtech Rödl, Mathias Schacht, 2007, J. Comb. Theory, Ser. A.

Ramsey Properties of Random k-Partite, k-Uniform Hypergraphs

Vojtech Rödl, Mathias Schacht, Andrzej Rucinski, 2007, SIAM J. Discret. Math..

Sharp thresholds for Ramsey properties of strictly balanced nearly bipartite graphs

Mathias Schacht, Fabian Schulenburg, M. Schacht, 2016, Random Struct. Algorithms.

A counting lemma for sparse pseudorandom hypergraphs

Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Mathias Schacht, 2015, Electron. Notes Discret. Math..

Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions

Vojtech Rödl, Noga Alon, Hiêp Hàn, 2007, SIAM J. Comput..

Loose Hamiltonian cycles forced by (k - 2)-degree - approximate version

Guilherme Oliveira Mota, Mathias Schacht, Josefran de Oliveira Bastos, 2016, Electron. Notes Discret. Math..

On Even-Degree Subgraphs of Linear Hypergraphs

Domingos Dellamonica, Vojtech Rödl, Brendan Nagle, 2012, Comb. Probab. Comput..

On the local density problem for graphs of given odd‐girth

Guilherme Oliveira Mota, Mathias Schacht, Christian Reiher, 2016, Electron. Notes Discret. Math..

Dirac-type results for loose Hamilton cycles in uniform hypergraphs

Hiêp Hàn, Mathias Schacht, M. Schacht, 2010, J. Comb. Theory, Ser. B.

Integer and fractional packings of hypergraphs

Vojtech Rödl, Mathias Schacht, Norihide Tokushige, 2007, J. Comb. Theory, Ser. B.

Hypergraphs with vanishing Turán density in uniformly dense hypergraphs

Vojtech Rödl, Mathias Schacht, Christian Reiher, 2017, J. Lond. Math. Soc..

Loose Hamiltonian cycles forced by large (k - 2)-degree - sharp version

Guilherme Oliveira Mota, Mathias Schacht, Josefran de Oliveira Bastos, 2017, Electron. Notes Discret. Math..

An algorithmic hypergraph regularity lemma

Vojtech Rödl, Brendan Nagle, Mathias Schacht, 2016, SODA.

On Colourings of Hypergraphs Without Monochromatic Fano Planes

Vojtech Rödl, Hanno Lefmann, Mathias Schacht, 2009, Combinatorics, Probability and Computing.

Weak quasi‐randomness for uniform hypergraphs

David Conlon, Hiêp Hàn, Mathias Schacht, 2012, Random Struct. Algorithms.

Ramsey-type numbers involving graphs and hypergraphs with large girth

Vojtech Rödl, Hiêp Hàn, Mathias Schacht, 2015, Electron. Notes Discret. Math..

Note on forcing pairs

Hiêp Hàn, Mathias Schacht, Yury Person, 2011, Electron. Notes Discret. Math..

Generalizations of the removal lemma

Vojtech Rödl, Mathias Schacht, V. Rödl, 2009, Comb..

Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs

Hiêp Hàn, Mathias Schacht, Enno Buß, 2011, Electron. Notes Discret. Math..

Untangling planar graphs from a specified vertex position - Hard cases

Oleg Verbitsky, Mathias Schacht, Oleg Pikhurko, 2011, Discret. Appl. Math..

Property testing in hypergraphs and the removal lemma

Vojtech Rödl, Mathias Schacht, 2007, STOC '07.

On the local density problem for graphs of given odd-girth

Guilherme Oliveira Mota, Mathias Schacht, Christian Reiher, 2019, J. Graph Theory.

High powers of Hamiltonian cycles in randomly augmented graphs

Andrzej Dudek, Mathias Schacht, Andrzej Rucinski, 2021, J. Graph Theory.

On the size-Ramsey number of grid graphs

Mathias Schacht, Anusch Taraz, Dennis Clemens, 2019, Comb. Probab. Comput..

Ramsey-type numbers involving graphs and hypergraphs with large girth

Vojtech Rödl, Mathias Schacht, Troy Retter, 2021, Comb. Probab. Comput..

Finding tight Hamilton cycles in random hypergraphs faster

Mathias Schacht, Deepak Bal, Pat Devlin, 2021, Comb. Probab. Comput..

Density theorems and extremal hypergraph problems

Mathias Schacht, Norihide Tokushige, Vojtěch Rödl, 2006 .

Quasirandomness in Hypergraphs

David Conlon, Elad Aigner-Horev, Mathias Schacht, 2018, The Electronic Journal of Combinatorics.

Tree-minimal graphs are almost regular

Domingos Dellamonica, Brendan Nagle, Mathias Schacht, 2012 .

On Six Problems Posed by Jarik Nešetřil

Mathias Schacht, Jørgen Bang-Jensen, Bjarne Toft, 2006 .

Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs

Mathias Schacht, Christian Reiher, Andrzej Ruci'nski, 2016, Proceedings of the London Mathematical Society.

Extremal Results in Random Graphs

Mathias Schacht, Vojtvech Rodl, M. Schacht, 2013, 1302.2248.

How Much Work Does It Take To Straighten a Plane Graph Out

Oleg Verbitsky, Mathias Schacht, Mihyun Kang, 2007 .

On the Regularity Method for Hypergraphs

Mathias Schacht, M. Schacht, 2004 .

Hamiltonian Berge cycles in random hypergraphs

Mathias Schacht, Deepak Bal, Pat Devlin, 2018, Combinatorics, Probability and Computing.

Sparse partition universal graphs for graphs of bounded degree

Yoshiharu Kohayakawa, Endre Szemerédi, Mathias Schacht, 2011 .

Loose Hamiltonian cycles forced by large $(k-2)$-degree - sharp version

Guilherme Oliveira Mota, Mathias Schacht, Josefran de Oliveira Bastos, 2017 .