Richard Mycroft

Computational Theory and Mathematics · 2011

A researcher in the Science corpus: 1 paper; trusts 6 researchers and is trusted by 4 researchers here, as inferred from the citation graph.

Subfields

• Computational Theory and Mathematics — 6 citations into it; #4,807 of 12,182 by trust here, #9,306 by citations
• Discrete Mathematics and Combinatorics — 6 citations into it; #740 of 2,017 by trust here, #1,251 by citations
• Geometry and Topology — 5 citations into it; #3,150 of 7,422 by trust here, #5,351 by citations

Whom Richard Mycroft trusts overall

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

1. William T. Gowers
2. D. Kühn
3. Vojtech Rödl
4. Deryk Osthus

Who trusts Richard Mycroft overall

1. Peter Keevash
2. Jie Han
3. Allan Siu Lun Lo
4. K. Markstrom

Papers from Richard Mycroft's perspective

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

1. Reducibility Among Combinatorial Problems
2. Regularity Lemma for k‐uniform hypergraphs (Random Struct. Algorithms)
3. Hypergraph regularity and the multidimensional Szemerédi theorem
4. A Dirac-Type Theorem for 3-Uniform Hypergraphs (Combinatorics, probability & computing)
5. Dirac-Type Questions For Hypergraphs — A Survey (Or More Problems For Endre To Solve)
6. Theory of linear and integer programming
7. Surveys in Combinatorics 2009: Embedding large subgraphs into dense graphs
8. Combinatorial theorems in sparse random sets
9. Independent sets in hypergraphs
10. Flag algebras (Journal of Symbolic Logic (JSL))

Their papers

• A Geometric Theory for Hypergraph Matching (2011) — 106 citations