K. Markstrom

2011

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

Whom K. Markstrom trusts overall

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

  1. Vojtech Rödl
  2. Peter Keevash
  3. Andrzej Rucinski
  4. Richard Mycroft

Who trusts K. Markstrom overall

  1. Jie Han

Papers from K. Markstrom's perspective

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

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

Their papers