Scan barcode
46 pages • missing pub info (editions)
ISBN/UID: 9781466387690
Format: Paperback
Language: English
Publisher: Createspace Independent Publishing Platform
Publication date: 02 October 2011
Description
We present a new polynomial-time algorithm for finding maximal independent sets in graphs. As a corollary, we obtain new bounds on the famous Ramsey numbers in terms of the maximum and minimum vertex degrees of the corresponding Ramsey graphs. The...
Community Reviews
Content Warnings
46 pages • missing pub info (editions)
ISBN/UID: 9781466387690
Format: Paperback
Language: English
Publisher: Createspace Independent Publishing Platform
Publication date: 02 October 2011
Description
We present a new polynomial-time algorithm for finding maximal independent sets in graphs. As a corollary, we obtain new bounds on the famous Ramsey numbers in terms of the maximum and minimum vertex degrees of the corresponding Ramsey graphs. The...
Community Reviews
Content Warnings