Abstract

An algorithm for the construction of Ramsey graphs with a given automorphism group G is presented. To find a graph on n vertices with no clique of k vertices. Kk • and no independent set of I vertices. 7

Publication Date

1988

Comments

Originally published in The Journal of Graph Theory by John Wiley and Sons, Ltd.Note: imported from RIT’s Digital Media Library running on DSpace to RIT Scholar Works in February 2014.

Document Type

Article

Department, Program, or Center

Center for Advancing the Study of CyberInfrastructure

Campus

RIT – Main Campus

Share

COinS