Applications of integer programming methods to cages (Q907225)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6534966
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Applications of integer programming methods to cages |
scientific article; zbMATH DE number 6534966 |
Statements
Applications of integer programming methods to cages (English)
0 references
25 January 2016
0 references
Summary: 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.
0 references
integer programming applications
0 references
cage problem
0 references
0.8358388
0 references
0.8313907
0 references
0.8287548
0 references
0.8251237
0 references
