Simonovits, Miklós and T. Sós, Vera (1984) On restricted colourings of Kn. COMBINATORICA, 4 (1). pp. 101110. ISSN 02099683

Text
SimonovitsSos1984_Article_OnRestrictedColouringsOfKn.pdf Download (484kB)  Preview 
Abstract
The authors investigate Ramseytype extremal problems for finite graphs. In Section 1, antiRamsey numbers for paths are determined. For positive integers k and n let r=f(n,Pk) be the maximal integer such that there exists an edge colouring of Kn using precisely r colours but not containing any coloured path on k vertices with all edges having different colors. It is shown that f(n,P2k+3+ε)=t⋅n−(t+12)+1+ε for t≥5, n>c⋅t2 and ε=0,1. In Section 2, K3spectra of colourings are determined. Given S⊆{1,2,3}, the authors investigate for which r and n there exist edge colourings of Kn using precisely r colours such that all triangles are scoloured for some s∈S and, conversely, every s∈S occurs. Section 3 contains suggestions for further research.
Item Type:  Article 

Uncontrolled Keywords:  AMS subject classification (1980): 05C35, 05C55, 05C38 
Subjects:  Q Science / természettudomány > QA Mathematics / matematika 
SWORD Depositor:  MTMT SWORD 
Depositing User:  MTMT SWORD 
Date Deposited:  27 Jun 2020 06:49 
Last Modified:  27 Jun 2020 06:49 
URI:  http://real.mtak.hu/id/eprint/110563 
Actions (login required)
Edit Item 