Mathias Schacht

According to our database1, Mathias Schacht authored at least 60 papers between 2004 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
Sharp thresholds for Ramsey properties of strictly balanced nearly bipartite graphs.
Random Struct. Algorithms, 2018

Hypergraphs with vanishing Turán density in uniformly dense hypergraphs.
J. London Math. Society, 2018

Quasirandomness in Hypergraphs.
Electr. J. Comb., 2018

2017
Loose Hamiltonian Cycles Forced by Large (k-2)-Degree - Approximate Version.
SIAM J. Discrete Math., 2017

Monochromatic trees in random graphs.
Electronic Notes in Discrete Mathematics, 2017

On the local density problem for graphs of given odd-girth.
Electronic Notes in Discrete Mathematics, 2017

Loose Hamiltonian cycles forced by large (k - 2)-degree - sharp version.
Electronic Notes in Discrete Mathematics, 2017

Quasirandomness in hypergraphs.
Electronic Notes in Discrete Mathematics, 2017

Counting results for sparse pseudorandom hypergraphs II.
Eur. J. Comb., 2017

Counting results for sparse pseudorandom hypergraphs I.
Eur. J. Comb., 2017

Ramsey properties of random graphs and Folkman numbers.
Discussiones Mathematicae Graph Theory, 2017

An exponential-type upper bound for Folkman numbers.
Combinatorica, 2017

2016
Embedding tetrahedra into quasirandom hypergraphs.
J. Comb. Theory, Ser. B, 2016

Packing minor-closed families of graphs into complete graphs.
J. Comb. Theory, Ser. B, 2016

Loose Hamiltonian cycles forced by (k - 2)-degree - approximate version.
Electronic Notes in Discrete Mathematics, 2016

An Algorithmic Hypergraph Regularity Lemma.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015
On the Structure of Graphs with Given Odd Girth and Large Minimum Degree.
Journal of Graph Theory, 2015

Packing minor closed families of graphs.
Electronic Notes in Discrete Mathematics, 2015

A counting lemma for sparse pseudorandom hypergraphs.
Electronic Notes in Discrete Mathematics, 2015

Ramsey-type numbers involving graphs and hypergraphs with large girth.
Electronic Notes in Discrete Mathematics, 2015

Ramsey numbers for bipartite graphs with small bandwidth.
Eur. J. Comb., 2015

2014
Upper bounds on probability thresholds for asymmetric Ramsey properties.
Random Struct. Algorithms, 2014

Extremal results for odd cycles in sparse pseudorandom graphs.
Combinatorica, 2014

2013
Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs.
J. Comb. Theory, Ser. B, 2013

Extremal results for odd cycles in sparse pseudorandom graphs.
Electronic Notes in Discrete Mathematics, 2013

2012
Complete Partite subgraphs in dense hypergraphs.
Random Struct. Algorithms, 2012

Weak quasi-randomness for uniform hypergraphs.
Random Struct. Algorithms, 2012

On Even-Degree Subgraphs of Linear Hypergraphs.
Combinatorics, Probability & Computing, 2012

2011
Note on forcing pairs.
Electronic Notes in Discrete Mathematics, 2011

Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs.
Electronic Notes in Discrete Mathematics, 2011

An expected polynomial time algorithm for coloring 2-colorable 3-graphs.
Discrete Mathematics & Theoretical Computer Science, 2011

Untangling planar graphs from a specified vertex position - Hard cases.
Discrete Applied Mathematics, 2011

2010
Note on Bipartite Graph Tilings.
SIAM J. Discrete Math., 2010

Ramsey properties of random discrete structures.
Random Struct. Algorithms, 2010

Weak hypergraph regularity and linear hypergraphs.
J. Comb. Theory, Ser. B, 2010

Dirac-type results for loose Hamilton cycles in uniform hypergraphs.
J. Comb. Theory, Ser. B, 2010

2009
On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree.
SIAM J. Discrete Math., 2009

An expected polynomial time algorithm for coloring 2-colorable 3-graphs.
Electronic Notes in Discrete Mathematics, 2009

Note on strong refutation algorithms for random k-SAT formulas.
Electronic Notes in Discrete Mathematics, 2009

On Colourings of Hypergraphs Without Monochromatic Fano Planes.
Combinatorics, Probability & Computing, 2009

Generalizations of the removal lemma.
Combinatorica, 2009

Almost all hypergraphs without Fano planes are bipartite.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Hypergraph regularity and quasi-randomness.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

2008
Spanning 3-colourable subgraphs of small bandwidth in dense graphs.
J. Comb. Theory, Ser. B, 2008

On the Ramsey Number of Sparse 3-Graphs.
Graphs and Combinatorics, 2008

Note on the 3-graph counting lemma.
Discrete Mathematics, 2008

2007
Ramsey Properties of Random k-Partite, k-Uniform Hypergraphs.
SIAM J. Discrete Math., 2007

Every Monotone 3-Graph Property is Testable.
SIAM J. Discrete Math., 2007

Integer and fractional packings of hypergraphs.
J. Comb. Theory, Ser. B, 2007

Turán's theorem for pseudo-random graphs.
J. Comb. Theory, Ser. A, 2007

Embedding spanning subgraphs of small bandwidth.
Electronic Notes in Discrete Mathematics, 2007

Regular Partitions of Hypergraphs: Counting Lemmas.
Combinatorics, Probability & Computing, 2007

Regular Partitions of Hypergraphs: Regularity Lemmas.
Combinatorics, Probability & Computing, 2007

Property testing in hypergraphs and the removal lemma.
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

On the bandwidth conjecture for 3-colourable graphs.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions.
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

2006
The counting lemma for regular k-uniform hypergraphs.
Random Struct. Algorithms, 2006

2005
Globally bounded local edge colourings of hypergraphs.
Electronic Notes in Discrete Mathematics, 2005

Every Monotone 3-Graph Property is Testable.
Electronic Notes in Discrete Mathematics, 2005

2004
The Turán Theorem for Random Graphs.
Combinatorics, Probability & Computing, 2004


  Loading...