Skip to main content
Springer Nature Link
Log in

The Generation of Maximal Triangle-Free Graphs

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1.  Fakultät für Mathematik, Universität Bielefeld, D 33501 Bielefeld, Germany e-mail: gunnar@mathematik.uni-bielefeld.de, , , , , , DE

    Gunnar Brinkmann

  2.  FSP Mathematisierung, Universität Bielefeld, D 33501 Bielefeld, Germany e-mail: harmuth@mathematik.uni-bielefeld.de, , , , , , DE

    Thomas Harmuth

Authors
  1. Stephan Brandt
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gunnar Brinkmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Thomas Harmuth
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received: March 19, 1997 Revised: October 27, 1997

Rights and permissions

Reprints and permissions

About this article

Cite this article

Brandt, S., Brinkmann, G. & Harmuth, T. The Generation of Maximal Triangle-Free Graphs. Graphs Comb 16, 149–157 (2000). https://doi.org/10.1007/PL00021176

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/PL00021176

Keywords