## Abstract The Ramsey number __R__(__G__~1~,__G__~2~) of two graphs __G__~1~ and __G__~2~ is the least integer __p__ so that either a graph __G__ of order __p__ contains a copy of __G__~1~ or its complement __G__^c^ contains a copy of __G__~2~. In 1973, Burr and ErdΕs offered a total of $25 for se
β¦ LIBER β¦
A Linear Heterochromatic Number of Graphs
β Scribed by J.J. Montellano-Ballesteros; V. Neumann-Lara
- Publisher
- Springer Japan
- Year
- 2003
- Tongue
- English
- Weight
- 239 KB
- Volume
- 19
- Category
- Article
- ISSN
- 0911-0119
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Linear Ramsey numbers of sparse graphs
β
Lingsheng Shi
π
Article
π
2005
π
John Wiley and Sons
π
English
β 102 KB
Quasi-planar graphs have a linear number
β
Pankaj K. Agarwal; Boris Aronov; JΓ‘nos Pach; Richard Pollack; Micha Sharir
π
Article
π
1997
π
Springer-Verlag
π
English
β 467 KB
The coloring of graphs in a linear numbe
β
A. A. Kalnin'sh
π
Article
π
1974
π
Springer US
π
English
β 830 KB
The number of linear extensions of bipar
β
Grzegorz Stachowiak
π
Article
π
1988
π
Springer Netherlands
π
English
β 124 KB
The number of linear extensions among the orientations of a bipartite graph is maximum just if the orientation itself is bipartite, the natural one.
On graphs with linear Ramsey numbers
β
R. L. Graham; V. RΓΆdl; A. RuciΕski
π
Article
π
2000
π
John Wiley and Sons
π
English
β 141 KB
π 1 views
Subdivided graphs have linear ramsey num
β
Noga Alon
π
Article
π
1994
π
John Wiley and Sons
π
English
β 247 KB
## Abstract It is shown that the Ramsey number of any graph with __n__ vertices in which no two vertices of degree at least 3 are adjacent is at most 12__n__. In particular, the above estimate holds for the Ramsey number of any __n__βvertex subdivision of an arbitrary graph, provided each edge of t