Name
Abstract | ||
|---|---|---|
For every positive integer r there exists a constant C r depending only on r such that for every colouring of the edges of the complete bipartite graph K n , n with r colours, there exists a set of at most C r monochromatic cycles whose vertex sets partition the vertex set of K n , n . This answers a question raised by Erdős, Gyárfás, and Pyber. |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1006/jctb.1997.1737 | J. Comb. Theory, Ser. B |
Keywords | Field | DocType |
monochromatic cycle,complete bipartite graph | Discrete mathematics,Complete bipartite graph,Combinatorics,Monochromatic color,Vertex (geometry),Vertex (graph theory),Bipartite graph,Matching (graph theory),Partition (number theory),Mathematics,Maximal independent set | Journal |
Volume | Issue | ISSN |
69 | 2 | Journal of Combinatorial Theory, Series B |
Citations | PageRank | References |
28 | 2.74 | 2 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| P. E. Haxell | 1 | 212 | 26.40 |