40 search results - page 4 / 8 » A Note on the Road-Coloring Conjecture |
CORR
2007
Springer
13 years 7 months ago
2007
Springer
We study the following two functions: d(n, c) and d(n, c); d(n, c) (d(n, c)) is the minimum number k such that every c-edge-colored undirected (directed) graph of order n and mini...
IJMMS
2000
13 years 7 months ago
2000
We survey five mathematical discovery programs by looking in detail at the discovery processes they illustrate and the success they've had. We focus on how they estimate the ...
JCT
2010
13 years 5 months ago
2010
Abstract. A weighting of the edges of a graph is called vertexcoloring if the weighted degrees of the vertices yield a proper coloring of the graph. In this paper we show that such...
CORR
2002
Springer
13 years 7 months ago
2002
Springer
In this note we study the existence of a solution to the survey-propagation equations for the random K-satisfiability problem for a given instance. We conjecture that when the num...
CAGD
2004
13 years 7 months ago
2004
This note conjectures that if two surface patches intersect with G1 continuity along an entire curve, the probability is one that the curve is rational. This idea has significance...