|
|||||
|
|
The Generation of Maximal Triangle-Free Graphs |
|
| Authors: | Stephan Brandt Gunnar Brinkmann Thomas Harmuth |
| Affiliation: | 1.?Fakult?t für Mathematik, Universit?t Bielefeld, D 33501 Bielefeld, Germany e-mail: gunnar@mathematik.uni-bielefeld.de,DE;2.?FSP Mathematisierung, Universit?t Bielefeld, D 33501 Bielefeld, Germany e-mail: harmuth@mathematik.uni-bielefeld.de,DE |
| Abstract: | In this paper we present an efficient algorithm for generating maximal triangle-free graphs. A program based on this algorithm has been used to check a conjecture of Erdo´´s about the local density of triangle-free graphs and turned out to be very powerful for the computation of triangle Ramsey numbers. |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |