activity
19942016
most citedExperimental determination of Ramsey numbers

101 citations · 221 across the 6 of their papers we have counts for

collaborators

6 papers

quant-ph2016★ 4 cited

Generalized Ramsey numbers through adiabatic quantum optimization

Mani Ranjbar, William G. Macready, Lane Clark +1

Ramsey theory is an active research area in combinatorics whose central theme is the emergence of order in large disordered structures, with Ramsey numbers marking the threshold at…

quant-ph2013★ 46 cited

Graph isomorphism and adiabatic quantum computing

Frank Gaitan, Lane Clark

In the Graph Isomorphism problem two N-vertex graphs G and G' are given and the task is to determine whether there exists a permutation of the vertices of G that preserves adjacenc…

math.CO2013

The Distribution of Ramsey Numbers

Lane Clark, Frank Gaitan

We prove that the number of integers in the interval [0,x] that are non-trivial Ramsey numbers r(k,n) (3 <= k <= n) has order of magnitude (x ln x)**(1/2).

quant-ph2012★ 101 cited

Experimental determination of Ramsey numbers

Zhengbing Bian, Fabian Chudak, William G. Macready +2

Ramsey theory is a highly active research area in mathematics that studies the emergence of order in large disordered structures. Ramsey numbers mark the threshold at which order f…

quant-ph2011★ 69 cited

Ramsey numbers and adiabatic quantum computing

Frank Gaitan, Lane Clark

The graph-theoretic Ramsey numbers are notoriously difficult to calculate. In fact, for the two-color Ramsey numbers with , only nine are currently known. We pr…

math.CO1994★ 1 cited

Algorithms for learning and teaching sets of vertices in graphs

Lane H. Clark, Patricia A. Evans, Michael R. Fellows +1

The learning complexity of special sets of vertices in graphs is studied in the model(s) of exact learning by (extended) equivalence and membership queries. Polynomial-time learnin…