Generalized Ramsey numbers for paths in 2 -chromatic graphs

R. Meenakshi and P. S. Sundararaghavan

International Journal of Mathematics and Mathematical Sciences, 1986, vol. 9, 1-4

Abstract:

Chung and Liu have defined the d -chromatic Ramsey number as follows. Let 1 ≤ d ≤ c and let t = ( c d ) . Let 1 , 2 , … , t be the ordered subsets of d colors chosen from c distinct colors. Let G 1 , G 2 , … , G t be graphs. The d -chromatic Ramsey number denoted by r d c ( G 1 , G 2 , … , G t ) is defined as the least number p such that, if the edges of the complete graph K p are colored in any fashion with c colors, then for some i , the subgraph whose edges are colored in the i th subset of colors contains a G i . In this paper it is shown that r 2 3 ( P i , P j , P k ) = [ ( 4 k + 2 j + i − 2 ) / 6 ] where i ≤ j ≤ k < r ( P i , P j ) , r 2 3 stands for a generalized Ramsey number on a 2 -colored graph and P i is a path of order i .

Date: 1986
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/9/560279.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/9/560279.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:560279

DOI: 10.1155/S0161171286000339

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().