Carsten Schultz

with Longueville · 2001–2006

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

Whom Carsten Schultz trusts overall

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

1. Dmitry N. Kozlov
2. Jirí Matousek

Papers from Carsten Schultz's perspective

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

1. Kneser's Conjecture
2. MAX k-CUT and approximating the chromatic number of random graphs
3. A simple proof for folds on both sides in complexes of graph homomorphisms
4. Homological Connectivity Of Random 2-Complexes (Comb.)
5. Complexes of Connected Graphs
6. On the chromatic number of Kneser hypergraphs
7. Proof of the Lovász conjecture
8. A personal communication
9. Graphs and homomorphisms (Oxford lecture series in mathematics and its applications)
10. Higher Algebraic K-Theory

Their papers

• Graph colorings, spaces of edges and spaces of circuits☆ (2006) — 52 citations
• The cohomology rings of complements of subspace arrangements (2001) — 65 citations