Christian Reiher

Computational Theory and Mathematics · 2007–2016

A researcher in the Science corpus: 3 papers; trusts 2 researchers and is trusted by 5 researchers here, as inferred from the citation graph.

Subfields

• Computational Theory and Mathematics — 6 citations into it; #6,437 of 12,182 by trust here, #11,462 by citations
• Discrete Mathematics and Combinatorics — 6 citations into it; #625 of 2,017 by trust here, #1,051 by citations
• Geometry and Topology — 6 citations into it; #4,108 of 7,422 by trust here, #6,910 by citations

Whom Christian Reiher trusts overall

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

1. Alexander A. Razborov
2. Vladimir Nikiforov
3. Yi Zhao
4. Vojtech Rödl

Who trusts Christian Reiher overall

1. David Conlon
2. Joonkyung Lee
3. Wolfgang A. Schmid
4. Weidong Gao
5. Alfred Geroldinger
6. Yves Edel

Papers from Christian Reiher's perspective

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

1. Flag algebras (Journal of Symbolic Logic (JSL))
2. Recent advances on Dirac-type problems for hypergraphs
3. Graphs and Hypergraphs (Clustering)
4. The number of cliques in graphs of given order and size
5. Counting Graph Homomorphisms
6. Hypergraph regularity and the multidimensional Szemerédi theorem
7. Which graphs are determined by their spectrum
8. The signless Laplacian spread
9. The energy of graphs and matrices
10. SINGULAR VALUE INEQUALITY AND GRAPH ENERGY CHANGE

Their papers

• The clique density theorem (2012) — 110 citations
• Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs (2016) — 57 citations
• On Kemnitz’ conjecture concerning lattice-points in the plane (2007) — 96 citations