Name
Abstract | ||
|---|---|---|
We show that for any 2-local colouring of the edges of the balanced complete bipartite graph Kn,n, its vertices can be covered with at most 3 disjoint monochromatic paths. And, we can cover almost all vertices of any complete or balanced complete bipartite r-locally coloured graph with O(r2) disjoint monochromatic cycles. We also determine the 2-local bipartite Ramsey number of a path almost exactly: Every 2-local colouring of the edges of Kn,n contains a monochromatic path on n vertices. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1016/j.ejc.2016.09.003 | European Journal of Combinatorics |
Field | DocType | Volume |
Discrete mathematics,Complete bipartite graph,Combinatorics,Vertex (geometry),Bipartite graph,Matching (graph theory),Ramsey's theorem,Frequency partition of a graph,Cograph,Mathematics,Domatic number | Journal | 60 |
Issue | ISSN | Citations |
C | 0195-6698 | 2 |
PageRank | References | Authors |
0.40 | 22 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Richard Lang | 1 | 3 | 0.76 |
| maya stein | 2 | 81 | 15.65 |