120 search results - page 2 / 24 » Cycle lengths in sparse graphs |
DM
2007
14 years 9 months ago
2007
: For two given graphs G1 and G2, the Ramsey number R(G1, G2) is the smallest integer n such that for any graph G of order n, either G contains G1 or the complement of G contains G...
103
click to vote
JGT
2010
14 years 8 months ago
2010
In 1966 Erd˝os and Hajnal proved that the chromatic number of graphs whose
74
Voted
GC
2002
Springer
14 years 9 months ago
2002
Springer
We prove that for every c > 0 there exists a constant K = K(c) such that every graph G with n vertices and minimum degree at least cn contains a cycle of length t for every even...
ENDM
2008
14 years 9 months ago
2008
A strong oriented k-coloring of an oriented graph G is a homomorphism from G to H having k vertices labelled by the k elements of an abelian additive group M, such that for any p...
DM
2008
14 years 9 months ago
2008
