File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: The Independence Number of Graphs with a Forbidden Cycle and Ramsey Numbers

TitleThe Independence Number of Graphs with a Forbidden Cycle and Ramsey Numbers
Authors
KeywordsGraph coloring
Independence number
Probabilistic method
Ramsey number
Issue Date2003
PublisherSpringer Verlag Dordrecht. The Journal's web site is located at http://springerlink.metapress.com/openurl.asp?genre=journal&issn=1382-6905
Citation
Journal Of Combinatorial Optimization, 2003, v. 7 n. 4, p. 353-359 How to Cite?
AbstractLet k ≥ 5 be a fixed integer and let m = ⌊(k - 1)/2⌋. It is shown that the independence number of a Ck-free graph is at least c1 [Σd(v)1/(m-1)](m-1)/m and that, for odd k, the Ramsey number r(Ck, Kn) is at most c 2(nm+1 / log n)1/m, where c1 = c1(m) > 0 and c2 = c2(m) > 0.
Persistent Identifierhttp://hdl.handle.net/10722/75326
ISSN
2015 Impact Factor: 1.08
2015 SCImago Journal Rankings: 1.093
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorLi, Yen_HK
dc.contributor.authorZang, Wen_HK
dc.date.accessioned2010-09-06T07:10:04Z-
dc.date.available2010-09-06T07:10:04Z-
dc.date.issued2003en_HK
dc.identifier.citationJournal Of Combinatorial Optimization, 2003, v. 7 n. 4, p. 353-359en_HK
dc.identifier.issn1382-6905en_HK
dc.identifier.urihttp://hdl.handle.net/10722/75326-
dc.description.abstractLet k ≥ 5 be a fixed integer and let m = ⌊(k - 1)/2⌋. It is shown that the independence number of a Ck-free graph is at least c1 [Σd(v)1/(m-1)](m-1)/m and that, for odd k, the Ramsey number r(Ck, Kn) is at most c 2(nm+1 / log n)1/m, where c1 = c1(m) > 0 and c2 = c2(m) > 0.en_HK
dc.languageengen_HK
dc.publisherSpringer Verlag Dordrecht. The Journal's web site is located at http://springerlink.metapress.com/openurl.asp?genre=journal&issn=1382-6905en_HK
dc.relation.ispartofJournal of Combinatorial Optimizationen_HK
dc.subjectGraph coloringen_HK
dc.subjectIndependence numberen_HK
dc.subjectProbabilistic methoden_HK
dc.subjectRamsey numberen_HK
dc.titleThe Independence Number of Graphs with a Forbidden Cycle and Ramsey Numbersen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1382-6905&volume=7&spage=353&epage=359&date=2003&atitle=The+Independence+Number+of+Graphs+with+a+Forbidden+Cycle+and+Ramsey+Numbersen_HK
dc.identifier.emailZang, W:wzang@maths.hku.hken_HK
dc.identifier.authorityZang, W=rp00839en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1023/B:JOCO.0000017383.13275.17en_HK
dc.identifier.scopuseid_2-s2.0-1842739330en_HK
dc.identifier.hkuros88799en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-1842739330&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume7en_HK
dc.identifier.issue4en_HK
dc.identifier.spage353en_HK
dc.identifier.epage359en_HK
dc.identifier.isiWOS:000189208100003-
dc.publisher.placeNetherlandsen_HK
dc.identifier.scopusauthoridLi, Y=7502087425en_HK
dc.identifier.scopusauthoridZang, W=7005740804en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats