Paper Info
Title
Ramsey Numbers For Small Graphs Versus Small Disconnected Graphs
Abstract
The Ramsey number r(G, H) is determined for all disconnected (isolatefree) graphs H of order six and all graphs G of order at most five, except the three cases (G, H) is an element of{(K-5 - 2K(2), 2K(3)), (K-5 - e, 2K(3)), ( K-5, 2K(3))} where bounds with difference 1 are established. Moreover, general results are obtained for some small disconnected graphs H and any graph G.
Year
Venue
DocType
2011
AUSTRALASIAN JOURNAL OF COMBINATORICS
Journal
Volume
ISSN
Citations 
51
2202-3518
0
PageRank 
References 
Authors
0.34
0
2
Name
Order
Citations
PageRank
Roland Lortz100.34
Ingrid Mengersen2106.12