A linear upper bound in zero-sum Ramsey theory

Yair Caro

International Journal of Mathematics and Mathematical Sciences, 1994, vol. 17, 1-4

Abstract:

Let n , r and k be positive integers such that k | ( n r ) . There exists a constant c ( k , r ) such that for fixed k and r and for every group A of order k R ( K n r , A ) ≤ n + c ( k , r ) , where R ( K n r , A ) is the zero-sum Ramsey number introduced by Bialostocki and Dierker [1], and K n r is the complete r -uniform hypergraph on n -vertices.

Date: 1994
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/17/962176.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/17/962176.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:962176

DOI: 10.1155/S0161171294000864

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 ().