Applications of integer programming methods to cages

de Ruiter, Frans and Biggs, Norman (2015) Applications of integer programming methods to cages. Electronic Journal of Combinatorics, 22 (4). P4.35. ISSN 1077-8926

Preview

PDF - Published Version Download (282kB) | Preview

• Publisher

Abstract

The aim of this paper is to construct new small regular graphs with girth 7 using integer programming techniques. Over the last two decades solvers for integer programs have become more and more powerful and have proven to be a useful aid for many hard combinatorial problems. Despite successes in many related fields, these optimisation tools have so far been absent in the quest for small regular graphs with a given girth. Here we illustrate the power of these solvers as an aid to construct small regular girth 7 graphs from girth 8 cages

Item Type:	Article
Official URL:	http://www.combinatorics.org/ojs/index.php/eljc/in...
Additional Information:	© 2015 The Authors
Divisions:	Mathematics
Subjects:	Q Science > QA Mathematics
Date Deposited:	18 Mar 2016 11:59
Last Modified:	24 Apr 2024 21:57
URI:	http://eprints.lse.ac.uk/id/eprint/65785

Actions (login required)

View Item