Untitled - CS@RIT - Rochester Institute of Technology

2 downloads 0 Views 1006KB Size Report
A (3k,n,e) Ramsey graph is a triangle-free graph on n vertices with e edges and no independent set of size k. Similarly, a (3*)-, (3k,n) or (3k,n,e-graph is a (3k,n ...