Paper Info
Title
On the Ramsey Number R(4, 6).
Abstract
The lower bound for the classical Ramsey number R(4, 6) is improved from 35 to 36. The author has found 37 new edge colorings of K-35 that have no complete graphs of order 4 in the first color, and no complete graphs of order 6 in the second color. The most symmetric of the colorings has an automorphism group of order 4, with one fixed point, and is presented in detail. The colorings were found using a heuristic search procedure.
Year
Venue
Keywords
2012
ELECTRONIC JOURNAL OF COMBINATORICS
edge coloring,ramsey number
Field
DocType
Volume
Automorphism group,Edge coloring,Discrete mathematics,Graph,Combinatorics,Heuristic,Upper and lower bounds,Ramsey's theorem,Fixed point,Mathematics
Journal
19
Issue
ISSN
Citations 
1.0
1077-8926
2
PageRank 
References 
Authors
0.39
1
1
Name
Order
Citations
PageRank
Geoffrey Exoo118739.86