Name
Abstract | ||
|---|---|---|
An (r, b)-graph is a graph that contains no clique of size r and no independent set of size b. The set of extremal Ramsey graphs ERG(r, b) consists of all (r, b)-graphs withR(r,b) - 1 vertices, where R(r, b) is the classical Ramsey number. We show that any G is an element of ERG(r, b) is r-1 vertex connected and 2r-4 edge connected for r, b >= 3. |
Year | Venue | Keywords |
|---|---|---|
2008 | AUSTRALASIAN JOURNAL OF COMBINATORICS | ramsey number |
Field | DocType | Volume |
Graph,Discrete mathematics,Combinatorics,Vertex (geometry),Clique,Ramsey's theorem,Independent set,Mathematics | Journal | 41 |
ISSN | Citations | PageRank |
2202-3518 | 2 | 0.42 |
References | Authors | |
2 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Andrew Beveridge | 1 | 55 | 8.21 |
| Oleg Pikhurko | 2 | 318 | 47.03 |