267 search results - page 1 / 54 » Anti-Ramsey properties of random graphs |
116
click to vote
JCT
2010
14 years 10 months ago
2010
We call a coloring of the edge set of a graph G a b-bounded coloring if no color is used more than b times. We say that a subset of the edges of G is rainbow if each edge is of a ...
72
Voted
TCC
2005
Springer
15 years 5 months ago
2005
Springer
105
click to vote
ICALP
2001
Springer
15 years 4 months ago
2001
Springer
We prove a lower bound of (n4/3 log1/3 n) on the randomized decision tree complexity of any nontrivial monotone n-vertex graph property, and of any nontrivial monotone bipartite g...
106
Voted
FOCS
2003
IEEE
15 years 5 months ago
2003
IEEE
We show that random graphs in the preferential connectivity model have constant conductance, and hence have worst-case routing congestion that scales logarithmically with the numb...
STOC
2004
ACM
16 years 19 days ago
2004
ACM
