caa a22 4500 475778235 CHVBK 20180406123637.0 cr unu---uuuuu 170329e20000601xx s 000 0 eng 10.1007/PL00021176 doi (NATIONALLICENCE)springer-10.1007/PL00021176 The Generation of Maximal Triangle-Free Graphs [Elektronische Daten] [Stephan Brandt, Gunnar Brinkmann, Thomas Harmuth] 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. Springer-Verlag Tokyo, 2000 Brandt Stephan aut Brinkmann Gunnar Fakultät für Mathematik, Universität Bielefeld, D 33501 Bielefeld, Germany e-mail: gunnar@mathematik.uni-bielefeld.de, DE aut Harmuth Thomas FSP Mathematisierung, Universität Bielefeld, D 33501 Bielefeld, Germany e-mail: harmuth@mathematik.uni-bielefeld.de, DE aut https://doi.org/10.1007/PL00021176 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/PL00021176 text/html Onlinezugriff via DOI NATIONALLICENCE 700 1- Brandt Stephan aut NATIONALLICENCE 700 1- Brinkmann Gunnar Fakultät für Mathematik, Universität Bielefeld, D 33501 Bielefeld, Germany e-mail: gunnar@mathematik.uni-bielefeld.de, DE aut NATIONALLICENCE 700 1- Harmuth Thomas FSP Mathematisierung, Universität Bielefeld, D 33501 Bielefeld, Germany e-mail: harmuth@mathematik.uni-bielefeld.de, DE aut Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer