617 search results - page 35 / 124 » On the Chromatic Number of Random Graphs |
EJC
2007
14 years 11 months ago
2007
Let K− r denote the graph obtained from Kr by deleting one edge. We show that for every integer r ≥ 4 there exists an integer n0 = n0(r) such that every graph G whose order n â...
114
click to vote
STOC
2005
ACM
16 years 3 days ago
2005
ACM
We introduce a new graph parameter, called the Grothendieck constant of a graph G = (V, E), which is defined as the least constant K such that for every A : E R, sup f:V S|V |-1 ...
WALCOM
2010
IEEE
15 years 6 months ago
2010
IEEE
Given a simple graph G, a harmonious coloring of G is a proper vertex coloring such that each pair of colors appears together on at most one edge. The harmonious chromatic number i...
COMBINATORICA
2008
14 years 12 months ago
2008
We show that if a graph G has the property that all subsets of vertices of size n/4 contain the "correct" number of triangles one would expect to find in a random graph ...
WAW
2004
Springer
15 years 5 months ago
2004
Springer
We study a random graph Gn that combines certain aspects of geometric random graphs and preferential attachment graphs. The vertices of Gn are n sequentially generated points x1, ...