𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Linear Programming in Some Ramsey Problems

✍ Scribed by B.D. Mckay; S.P. Radziszowski

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
332 KB
Volume
61
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

✦ Synopsis

We derive new upper bounds for the classical two-color Ramsey numbers (R(4,5) \leqslant 27, R(5,5) \leqslant 52), and (R(4,6) \leqslant 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. 1994 Academic Press, Inc.

πŸ“œ SIMILAR VOLUMES

The Difference between Finite Dimensiona
The Difference between Finite Dimensional Linear Programming Problems and Infinite Dimensional Linear Programming Problems
✍ Tvu-Ying Ho; Yuung-Yih Lur; Soon-Yi Wu πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 161 KB

This paper studies the difference between finite-dimensional linear programming problems and infinite dimensional linear programming problems. We discuss a special class of continuous linear programming problems. We develop the structure of extreme points of feasible region for this problem. Under s

A difficulty in linear programming for t
A difficulty in linear programming for transportation problems
✍ Marvin Luther; John E. Walsh πŸ“‚ Article πŸ“… 1959 πŸ› John Wiley and Sons 🌐 English βš– 184 KB

## Abstract Linear programming has many worthwhile applications to transportation problems of a relatively uncomplicated nature. For inore complicated problems, however, a realistic linear‐programming formulation can require such an excessive number of variables that obtaining a solution is not fea