7796 search results - page 34 / 1560 » On Generalized Schur Numbers |
CCCG
2004
13 years 11 months ago
2004
We establish upper and lower bounds on the number of connected components of lines tangent to four triangles in R3 . We show that four triangles in R3 may admit at least 88 tangent...
JGT
2006
13 years 9 months ago
2006
Jeager et al introduced a concept of group connectivity as an generalization of nowhere zero flows and its dual concept group coloring, and conjectured that every 5-edge connected...
RSA
2002
13 years 9 months ago
2002
: The decycling number (G) of a graph G is the smallest number of vertices which can be removed from G so that the resultant graph contains no cycles. In this paper, we study the d...
JUCS
2010
13 years 8 months ago
2010
Abstract: We study the number of matching substrings in the pattern matching problem. In general, there can be a quadratic number of matching substrings in the size of a given text...
CDC
2010
IEEE
13 years 4 months ago
2010
IEEE
The distributed estimation of the number of active sensors in a network can be important for estimation and organization purposes. We propose a design methodology based on the foll...