Name
Abstract | ||
|---|---|---|
We consider a generalisation of the classical Ramsey theory setting to a setting where each of the edges of the underlying host graph is coloured with a set of colours (instead of just one colour). We give bounds for monochromatic tree covers in this setting, both for an underlying complete graph, and an underlying complete bipartite graph. We also discuss a generalisation of Ramsey numbers to our setting and propose some other new directions. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.disc.2017.08.038 | Discrete Mathematics |
Field | DocType | Volume |
Ramsey theory,Complete bipartite graph,Complete graph,Discrete mathematics,Combinatorics,Generalization,Constraint graph,Transversal (geometry),Ramsey's theorem,Conjecture,Mathematics | Journal | 341 |
Issue | ISSN | Citations |
1 | 0012-365X | 0 |
PageRank | References | Authors |
0.34 | 12 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sebastián Bustamante | 1 | 0 | 2.03 |
| maya stein | 2 | 81 | 15.65 |