Title
Further Ramsey Numbers For Small Complete Bipartite Graphs
Abstract
The exact values of eleven Ramsey numbers r(K(l1),n(1), Kl(2),n(2)) where 3 <= l(1) + n(1), l(2) + n(2) <= 7 are determined, almost completing the table of all 66 such numbers.
Year
Venue
Keywords
2006
ARS COMBINATORIA
Ramsey number, complete bipartite graph
Field
DocType
Volume
Discrete mathematics,Complete bipartite graph,Combinatorics,Robertson–Seymour theorem,Forbidden graph characterization,Bipartite graph,Ramsey's theorem,Cograph,1-planar graph,Triangle-free graph,Mathematics
Journal
79
ISSN
Citations 
PageRank 
0381-7032
1
0.38
References 
Authors
0
2
Name
Order
Citations
PageRank
Roland Lortz121.07
Ingrid Mengersen2106.12