Name
Abstract | ||
|---|---|---|
The size-Ramsey number of a graph G is the minimum number of edges in a graph H such that every 2-edge-coloring of H yields a monochromatic copy of G. Size-Ramsey numbers of graphs have been studied for almost 40 years with particular focus on the case of trees and bounded degree graphs. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1002/jgt.22115 | Journal of Graph Theory |
Keywords | Field | DocType |
size-Ramsey numbers,hypergraphs | Discrete mathematics,Graph,Monochromatic color,Combinatorics,Constraint graph,Ramsey's theorem,Mathematics,Bounded function | Journal |
Volume | Issue | ISSN |
86 | 1 | 0364-9024 |
Citations | PageRank | References |
2 | 0.44 | 10 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Andrzej Dudek | 1 | 114 | 23.10 |
| steven la fleur | 2 | 2 | 0.44 |
| Dhruv Mubayi | 3 | 579 | 73.95 |
| Vojtech Rodl | 4 | 58 | 3.59 |