Mathias Schacht | Academic Influence

Mathias Schacht's AcademicInfluence.com Rankings

Mathias Schacht

Mathematics

#2695

World Rank

#4110

Historical Rank

Graph Theory

#61

World Rank

#68

Historical Rank

Measure Theory

#4077

World Rank

#4804

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Mathias Schacht's Degrees

PhD Mathematics University of Hamburg
Masters Mathematics University of Hamburg
Bachelors Mathematics University of Hamburg

Similar Degrees You Can Earn

Best Online Bachelor's in Math Ranked

Why Is Mathias Schacht Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Mathias Schacht is a German mathematician who specializes in graph theory. Schacht earned a diploma in business mathematics in 1999 from the Technical University of Berlin. He did his graduate studies at Emory University, completing a PhD in 2004 under the supervision of Vojtěch Rödl. His dissertation, on hypergraph generalizations of the Szemerédi regularity lemma, won the 2006 Richard Rado Prize of the German Mathematical Society. He worked at the Humboldt University of Berlin as a postdoctoral researcher and acting professor from 2004 until 2009, when he moved to the University of Hamburg. He received his habilitation from Humboldt University in 2010, and has been Heisenberg Professor at the University of Hamburg from 2010 to 2015.

(See a Problem?)

Mathias Schacht's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

The counting lemma for regular k‐uniform hypergraphs (2006) (222)
Extremal results for random discrete structures (2016) (138)
Regular Partitions of Hypergraphs: Regularity Lemmas (2007) (119)
On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree (2009) (116)
The counting lemma for regular k-uniform hypergraphs (2006) (103)
Proof of the bandwidth conjecture of Bollobás and Komlós (2009) (91)
Weak hypergraph regularity and linear hypergraphs (2010) (77)
On the KŁR conjecture in random graphs (2013) (76)
Dirac-type results for loose Hamilton cycles in uniform hypergraphs (2010) (75)
Regular Partitions of Hypergraphs: Counting Lemmas (2007) (68)
Generalizations of the removal lemma (2009) (63)
Weak quasi‐randomness for uniform hypergraphs (2012) (61)
The hypergraph regularity method and its applications. (2005) (57)
Ramsey properties of random discrete structures (2010) (56)
Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions (2007) (53)
Extremal Hypergraph Problems and the Regularity Method (2006) (52)
Sparse partition universal graphs for graphs of bounded degree (2011) (50)
Regularity Lemmas for Graphs (2010) (49)
Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs (2011) (49)
The Turán Theorem for Random Graphs (2004) (43)
On Colourings of Hypergraphs Without Monochromatic Fano Planes (2009) (40)
Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs (2016) (37)
Almost all hypergraphs without Fano planes are bipartite (2009) (35)
A structural result for hypergraphs with many restricted edge colorings (2010) (33)
Powers of Hamiltonian cycles in randomly augmented graphs (2018) (31)
Extremal Results in Random Graphs (2013) (29)
Property testing in hypergraphs and the removal lemma (2007) (29)
On the Ramsey Number of Sparse 3-Graphs (2008) (29)
Density theorems and extremal hypergraph problems (2006) (28)
Hypergraph regularity and quasi-randomness (2009) (28)
A note on perfect matchings in uniform hypergraphs with large minimum collective degree (2008) (27)
On a Turán problem in weakly quasirandom 3-uniform hypergraphs (2016) (27)
Ramsey Properties of Random k-Partite, k-Uniform Hypergraphs (2007) (25)
On Six Problems Posed by Jarik Nešetřil (2006) (25)
Packing minor-closed families of graphs into complete graphs (2016) (22)
Embedding tetrahedra into quasirandom hypergraphs (2016) (22)
Every Monotone 3-Graph Property is Testable (2005) (22)
Spanning 3-colourable subgraphs of small bandwidth in dense graphs (2008) (21)
Quasirandomness in hypergraphs (2017) (21)
Integer and fractional packings of hypergraphs (2007) (20)
Loose Hamiltonian Cycles Forced by Large (k-2)-Degree - Approximate Version (2016) (19)
Hypergraphs with vanishing Turán density in uniformly dense hypergraphs (2017) (18)
Upper bounds on probability thresholds for asymmetric Ramsey properties (2014) (18)
On a generalisation of Mantel's theorem to uniformly dense hypergraphs (2016) (17)
Loose Hamiltonian cycles forced by large (k - 2)-degree - sharp version (2017) (16)
Note on Bipartite Graph Tilings (2008) (15)
Turán's theorem for pseudo-random graphs (2007) (15)
An exponential-type upper bound for Folkman numbers (2016) (14)
On The Triangle Removal Lemma For Subgraphs of Sparse Pseudorandom Graphs (2010) (14)
Monochromatic trees in random graphs (2016) (13)
On the Hamiltonicity of Triple Systems with High Minimum Degree (2016) (12)
Sharp thresholds for Ramsey properties of strictly balanced nearly bipartite graphs (2016) (12)
High powers of Hamiltonian cycles in randomly augmented graphs (2021) (12)
Tree-minimal graphs are almost regular (2012) (11)
A sharp threshold for van der Waerden's theorem in random subsets (2015) (11)
On the size-Ramsey number of grid graphs (2019) (10)
Untangling planar graphs from a specified vertex position - Hard cases (2008) (9)
Discrepancy and eigenvalues of Cayley graphs (2016) (9)
On the Regularity Method for Hypergraphs (2004) (8)
Obfuscated Drawings of Planar Graphs (2008) (8)
Ramsey numbers for bipartite graphs with small bandwidth (2015) (8)
An expected polynomial time algorithm for coloring 2-colorable 3-graphs (2009) (8)
On the local density problem for graphs of given odd‐girth (2016) (7)
Protecting‐Group‐Free Total Syntheses of Rubrolide R and S (2017) (7)
Note on strong refutation algorithms for random k-SAT formulas (2009) (7)
Complete Partite subgraphs in dense hypergraphs (2012) (7)
On Even-Degree Subgraphs of Linear Hypergraphs (2012) (7)
Sharp thresholds for nonlinear Hamiltonian cycles in hypergraphs (2019) (6)
Minimum pair degree condition for tight Hamiltonian cycles in 4-uniform hypergraphs (2020) (6)
On the Structure of Graphs with Given Odd Girth and Large Minimum Degree (2015) (6)
Homomorphism Thresholds for Odd Cycles (2017) (6)
On the structure of Dense graphs with bounded clique number (2016) (6)
Some remarks on the extremal function for uniformly two-path dense hypergraphs (2016) (6)
A Note on Induced Ramsey Numbers (2016) (6)
How Much Work Does It Take To Straighten a Plane Graph Out (2007) (5)
Localised codegree conditions for tight Hamiltonian cycles in 3-uniform hypergraphs (2019) (5)
Note on the 3-graph counting lemma (2008) (5)
Note on forcing pairs (2011) (5)
An algorithmic hypergraph regularity lemma (2016) (5)
Embedding spanning subgraphs in uniformly dense and inseparable graphs (2019) (5)
Extremal results for odd cycles in sparse pseudorandom graphs (2013) (4)
Essentially infinite colourings of hypergraphs (2007) (4)
FORCING QUASIRANDOMNESS WITH TRIANGLES (2017) (4)
Pd-Catalyzed Synthesis of γ-Keto Esters as Key Intermediates for the Synthesis of γ-Hydroxybutenolides (2019) (3)
Counting results for sparse pseudorandom hypergraphs I (2016) (3)
Ramsey-type numbers involving graphs and hypergraphs with large girth (2015) (3)
Ramsey Properties of Random Graphs and Folkman Numbers (2016) (3)
Counting results for sparse pseudorandom hypergraphs II (2016) (3)
Hamiltonian Berge cycles in random hypergraphs (2018) (2)
LOOSE HAMILTONIAN CYCLES FORCED BY LARGE (2018) (2)
Minimum pair-degee for tight Hamiltonian cycles in 4-uniform hypergraphs (2019) (2)
Localized Codegree Conditions for Tight Hamilton Cycles in 3-Uniform Hypergraphs (2022) (2)
On quantitative aspects of a canonisation theorem for edge‐orderings (2020) (2)
Finding tight Hamilton cycles in random hypergraphs faster (2021) (1)
Canonical colourings in random graphs (2023) (1)
Sharp thresholds for Ramsey properties (2022) (1)
Packing minor closed families of graphs (2015) (1)
Loose Hamiltonian cycles forced by (k - 2)-degree - approximate version (2016) (1)
Size-Ramsey Number of Uniform Hypergraph Paths (2020) (1)
Odd cycles in subgraphs of sparse pseudorandom graphs (2019) (1)
Turán density of cliques of order five in 3-uniform hypergraphs with quasirandom links (2022) (1)
Density Theorems and Extremal Hypergraph Problems Density Theorems and Extremal Hypergraph Problems (2007) (0)
A counting lemma for sparse pseudorandom hypergraphs (2015) (0)
Regular partitions of hypergraphs and property testing (2010) (0)
TR-2004-018 A Short Proof of the 3-Graph Counting Lemma (2007) (0)
An exponential-type upper bound for Folkman numbers (2016) (0)
REGULAR PARTITIONS OF HYPERGRAPHS : COUNTING LEMMAS VOJTĚCH RÖDL AND (2007) (0)
Discrepancy and Eigenvalues of Cayley Graphs ( extended abstract ) (2006) (0)
Embedding spanning subgraphs of small bandwidth (2007) (0)
On the bandwidth conjecture for 3-colourable graphs (2007) (0)
Ramsey Theory (2014) (0)
Discrepancy and eigenvalues of Cayley graphs (2016) (0)
Homomorphism Thresholds for Odd Cycles (2020) (0)
On the Hamiltonicity of Triple Systems with High Minimum Degree (2017) (0)
Extremal results for odd cycles in sparse pseudorandom graphs (2014) (0)
Front Cover: Pd-Catalyzed Synthesis of γ-Keto Esters as Key Intermediates for the Synthesis of γ-Hydroxybutenolides (Eur. J. Org. Chem. 15/2019) (2019) (0)
Globally bounded local edge colourings of hypergraphs (2005) (0)
On the KŁR conjecture in random graphs (2014) (0)
Powers of Hamiltonian cycles in mu-inseparable graphs (2019) (0)
TR-2011-007 Tree-minimal graphs are almost regular (2011) (0)
1 J ul 2 01 9 Hamiltonian Berge Cycles in Random Hypergraphs ∗ (2019) (0)

This paper list is powered by the following services:

Other Resources About Mathias Schacht

en.wikipedia.org

What Schools Are Affiliated With Mathias Schacht?

Mathias Schacht is affiliated with the following schools: