𝔖 Bobbio Scriptorium
✦   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

## 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

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 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