Name
Abstract | ||
|---|---|---|
The Ramsey set R(G,H) consists of all graphs F with F --> (G,H) and F' negated right arrow (G,H) for every proper subgraph F' of F. In this paper we will characterize the graphs belonging to R(2K(2), K-1,K-n) with n greater than or equal to 3 and determine R(2K(2), K-1,K-n,,) for n less than or equal to 3 explicitly. (C) 1999 Elsevier Science B.V. All rights reserved. |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1016/S0166-218X(99)00089-X | DISCRETE APPLIED MATHEMATICS |
Keywords | Field | DocType |
Ramsey-minimal graphs, finite Ramsey sets | Graph theory,Graph,Discrete mathematics,Combinatorics,Finite set,Mathematics | Journal |
Volume | Issue | ISSN |
95 | 1-3 | 0166-218X |
Citations | PageRank | References |
5 | 1.24 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ingrid Mengersen | 1 | 10 | 6.12 |
| Jörg Oeckermann | 2 | 5 | 1.58 |