Name
Abstract | ||
|---|---|---|
For a sequence (Hi)i=1k of graphs, let nim(n;H1,…,Hk) denote the maximum number of edges not contained in any monochromatic copy of Hi in colour i, for any colour i, over all k-edge-colourings of Kn. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.jctb.2018.07.007 | Journal of Combinatorial Theory, Series B |
Keywords | Field | DocType |
Homomorphic Ramsey,Monochromatic copy of a fixed graph | Discrete mathematics,Strength of a graph,Combinatorics,Multigraph,Vertex (geometry),Hypercube graph,Bipartite graph,Cycle graph,Ramsey's theorem,Degree (graph theory),Mathematics | Journal |
Volume | ISSN | Citations |
135 | 0095-8956 | 0 |
PageRank | References | Authors |
0.34 | 16 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hong Liu | 1 | 39 | 8.54 |
| Oleg Pikhurko | 2 | 318 | 47.03 |
| Maryam Sharifzadeh | 3 | 11 | 3.83 |