Semidefinite Programming and Ramsey Numbers

Simple item page
dc.contributor.author Lidicky, Bernard
dc.contributor.author Lidicky, Bernard
dc.contributor.author Pfender, Florian
dc.contributor.department Mathematics
dc.date 2018-10-28T12:28:58.000
dc.date.accessioned 2020-06-30T06:00:13Z
dc.date.available 2020-06-30T06:00:13Z
dc.date.copyright Sun Jan 01 00:00:00 UTC 2017
dc.date.issued 2017-04-12
dc.description.abstract <p>We use the theory of flag algebras to find new upper bounds for several small graph and hypergraph Ramsey numbers. In particular, we prove the exact values R(K−, K−, K−) = 28, R(K8, C5) = 29, R(K9, C6) = 41, R(Q3, Q3) = 13, R(K3,5, K1,6) = 17, R(C3, C5, C5) = 17, and R(K−, K−; 3) = 12, and in addition improve many additional upper bounds.</p>
dc.description.comments <p>This is a manuscript made available through arxiv: <a href="https://arxiv.org/abs/1704.03592" target="_blank">https://arxiv.org/abs/1704.03592</a>.</p>
dc.format.mimetype application/pdf
dc.identifier archive/lib.dr.iastate.edu/math_pubs/183/
dc.identifier.articleid 1182
dc.identifier.contextkey 13167277
dc.identifier.s3bucket isulib-bepress-aws-west
dc.identifier.submissionpath math_pubs/183
dc.identifier.uri https://dr.lib.iastate.edu/handle/20.500.12876/54572
dc.language.iso en
dc.source.bitstream archive/lib.dr.iastate.edu/math_pubs/183/2017_Lidicky_SemidefiniteProgrammingPreprint.pdf|||Fri Jan 14 21:40:02 UTC 2022
dc.subject.disciplines Discrete Mathematics and Combinatorics
dc.subject.disciplines Mathematics
dc.title Semidefinite Programming and Ramsey Numbers
dc.type article
dc.type.genre article
dspace.entity.type Publication
relation.isAuthorOfPublication a1d8f5ab-9124-4104-981c-8ba1e426e3ff
relation.isOrgUnitOfPublication 82295b2b-0f85-4929-9659-075c93e82c48
File
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
2017_Lidicky_SemidefiniteProgrammingPreprint.pdf
Size:
425.38 KB
Format:
Adobe Portable Document Format
Description:
Download
Collections
Publications