COMBINATORICA
2011
13 years 13 days ago
2011
Given independent random points X1, . . . , Xn ∈ Rd with common probability distribution ν, and a positive distance r = r(n) > 0, we construct a random geometric graph Gn wi...
MP
2010
13 years 11 months ago
2010
Adding cuts based on copositive matrices, we propose to improve Lov´asz’ bound θ on the clique number and its tightening θ introduced by McEliece, Rodemich, Rumsey, and Schri...
COMBINATORICS
2004
14 years 14 days ago
2004
Let G be the intersection graph of a finite family of convex sets obtained by translations of a fixed convex set in the plane. We show that every such graph with clique number k i...
COMBINATORICS
2007
14 years 18 days ago
2007
We investigate the notion of quantum chromatic number of a graph, which is the minimal number of colours necessary in a protocol in which two separated provers can convince a refe...
ARSCOM
2006
14 years 20 days ago
2006
In this paper we define the concept of clique number of uniform hypergraph and study its relationship with circular chromatic number and clique number. For every positive integer ...
CORR
2010
Springer
14 years 21 days ago
2010
Springer
We obtain improved upper bounds and new lower bounds on the chromatic number as a linear function of the clique number, for the intersection graphs (and their complements) of fini...
LION
2009
Springer
14 years 7 months ago
2009
Springer
This work introduces new bounds on the clique number of graphs derived from a result due to S´os and Straus, which generalizes the Motzkin-Straus Theorem to a specific class of h...