Colton Magnant

Computational Theory and Mathematics · 2010–2015

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

Subfields

• Computational Theory and Mathematics — 5 citations into it

Whom Colton Magnant trusts overall

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

1. Pavel A. Pevzner
2. Béla Bollobás
3. Richard A. Brualdi
4. András Gyárfás

Papers from Colton Magnant's perspective

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

1. Edge colorings of complete graphs without tricolored triangles
2. Chromatic Graph Theory
3. On the evolution of random graphs
4. Computational molecular biology : an algorithmic approach
5. Probabilistic Methods in Combinatorics
6. Small Ramsey Numbers
7. On proper-path colorings in graphs
8. Random Graphs: Notation
9. Landau's inequalities for tournament scores and a short proof of a theorem on transitive sub-tournaments
10. Paths, Trees, and Flowers

Their papers

• Properly Colored Notions of Connectivity - A Dynamic Survey (2015) — 90 citations
• Rainbow Generalizations of Ramsey Theory - A Dynamic Survey (2014) — 100 citations
• An asymptotic version of a conjecture by Enomoto and Ota (2010) — 58 citations