Mathias Schacht

Computational Theory and Mathematics · 2006–2016

A researcher in the Science corpus: 7 papers; trusts 17 researchers and is trusted by 4 researchers here, as inferred from the citation graph.

Subfields

• Computational Theory and Mathematics — 39 citations into it
• Discrete Mathematics and Combinatorics — 37 citations into it; #744 of 2,017 by trust here, #640 by citations
• Geometry and Topology — 28 citations into it; #3,243 of 7,422 by trust here, #4,440 by citations

Whom Mathias Schacht trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. William T. Gowers
2. Vojtech Rödl
3. Béla Bollobás
4. Alan M. Frieze
5. Svante Janson
6. David Conlon
7. Alexander A. Razborov
8. Ben Joseph Green

Who trusts Mathias Schacht overall

1. Jozsef Balogh
2. A. Sah
3. Robert Morris
4. Wojciech Samotij
5. David Conlon
6. Terence Tao
7. Stefan Glock
8. Ben Joseph Green

Papers from Mathias Schacht's perspective

Ordered by how strongly the researchers Mathias Schacht trusts endorse each paper. Same corpus, a different order for every researcher.

1. The Probabilistic Method
2. Upper tails for subgraph counts in random graphs
3. Hypergraph containers
4. Dense Subsets of Pseudorandom Sets
5. The primes contain arbitrarily long arithmetic progressions
6. The number of cliques in graphs of given order and size
7. Regularity Lemmas for Graphs
8. An Approximate Version of Sidorenko’s Conjecture
9. Flag algebras (Journal of Symbolic Logic (JSL))
10. The counting lemma for regular k-uniform hypergraphs

Their papers

• Regularity Lemmas for Graphs (2010) — 58 citations
• Sparse partition universal graphs for graphs of bounded degree (2011) — 58 citations
• On the KŁR conjecture in random graphs (2013) — 80 citations
• Proof of the bandwidth conjecture of Bollobás and Komlós (2009) — 111 citations
• Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs (2016) — 57 citations
• Extremal results for random discrete structures (2016) — 163 citations
• The counting lemma for regular k-uniform hypergraphs (2006) — 97 citations