scholarly journals Bounds for Ramsey numbers of complete graphs dropping an edge

2008 ◽  
Vol 29 (1) ◽  
pp. 88-94 ◽  
Author(s):  
Yusheng Li ◽  
Jian Shen
2010 ◽  
Vol 27 (1) ◽  
pp. 121-128 ◽  
Author(s):  
Tao Jiang ◽  
Michael Salerno

2010 ◽  
Vol 31 (7) ◽  
pp. 1680-1688 ◽  
Author(s):  
L. Boza ◽  
M. Cera ◽  
P. García-Vázquez ◽  
M.P. Revuelta

2003 ◽  
Vol 12 (5-6) ◽  
pp. 495-511 ◽  
Author(s):  
Maria Axenovich ◽  
Tao Jiang ◽  
Z Tuza

A subgraph H in an edge-colouring is properly coloured if incident edges of H are assigned different colours, and H is rainbow if no two edges of H are assigned the same colour. We study properly coloured subgraphs and rainbow subgraphs forced in edge-colourings of complete graphs in which each vertex is incident to a large number of colours.


10.37236/239 ◽  
2009 ◽  
Vol 16 (1) ◽  
Author(s):  
Xiaodong Xu ◽  
Stanisław P. Radziszowski

In this note we show how to extend Mathon's cyclotomic colorings of the edges of some complete graphs without increasing the maximum order of monochromatic complete subgraphs. This improves the well known lower bound construction for multicolor Ramsey numbers, in particular we obtain $R_3(7) \ge 3214$.


2013 ◽  
Vol 77 (1) ◽  
pp. 19-38 ◽  
Author(s):  
John Lenz ◽  
Dhruv Mubayi

1980 ◽  
Vol 4 (2) ◽  
pp. 233-239 ◽  
Author(s):  
Gary Chartrand ◽  
Ronald J. Gould ◽  
Albert D. Polimeni

1992 ◽  
Vol 104 (1) ◽  
pp. 91-97
Author(s):  
P.J. Lorimer ◽  
W. Solomon

2016 ◽  
Vol 210 ◽  
pp. 200-206 ◽  
Author(s):  
Jonathan Chappelon ◽  
Luis Pedro Montejano ◽  
Jorge Luis Ramírez Alfonsín

Sign in / Sign up

Export Citation Format

Share Document