266 search results - page 9 / 54 » Chromatic Ramsey numbers |
GD
2005
Springer
14 years 26 days ago
2005
Springer
Let S be a set of horizontal line segments, or bars, in the plane. We say that G is a bar visibility graph, and S its bar visibility representation, if there exists a one-to-one co...
JCT
2007
13 years 7 months ago
2007
JGT
2010
13 years 5 months ago
2010
: We consider a problem related to Hadwiger’s Conjecture. Let
GC
2011
Springer
13 years 2 months ago
2011
Springer
The Ramsey number r(H, Kn) is the smallest positive integer N such that every graph of order N contains either a copy of H or an independent set of size n. The Tur´an number ex(m,...
EJC
2008
13 years 7 months ago
2008
For two given graphs G1 and G2, the Ramsey number R(G1, G2) is the smallest positive integer n such that for any graph G of order n, either G contains G1 or the complement of G co...