75 search results - page 1 / 15 » An improved bound for the monochromatic cycle partition numb... |
JCT
2006
13 years 9 months ago
2006
CPC
2008
13 years 10 months ago
2008
Suppose that n > (log k)ck , where c is a fixed positive constant. We prove that no matter how the edges of Kn are colored with k colors, there is a copy of K4 whose edges rece...
COMBINATORICS
2000
13 years 9 months ago
2000
The set R of relevant cycles of a graph G is the union of its minimum cycle bases. We introduce a partition of R such that each cycle in a class W can be expressed as a sum of oth...
STOC
1996
ACM
14 years 1 months ago
1996
ACM
A linear array network consists of k + 1 processors P0; P1; : : : ; Pk with links only between Pi and Pi+1 0 i k. It is required to compute some boolean function f x; y in this n...
DM
2010
13 years 10 months ago
2010
In the online F-avoidance edge-coloring game with r colors, a graph on n vertices is generated by at each stage randomly adding a new edge. The player must color each new edge as ...