Test environment running 7.6.6

Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Linear programming in some ramsey problems

Thumbnail Image

Date

1994

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

We derive new upper bounds for the classical two-color Ramsey numbers R(4, 5) ≤ 27, R(5, 5) ≤ 52, and R(4, 6) ≤ 43; the previous best upper bounds known for these numbers were 28, 53, and 44, respectively. The new bounds are obtained by solving large integer linear programs and with the help of other computer algorithms.

Description

Keywords

Citation

URI

https://dspace-test.anu.edu.au/handle/1885/733745099

Collections

DevOps Pure Testing

Source

Journal of Combinatorial Theory. Series B

Type

Comment/debate

Book Title

Entity type

Access Statement

License Rights

DOI

10.1006/jctb.1994.1038

Restricted until

DSpace software copyright © 2002-2026 LYRASIS