Edge number critical triangle free graphs with low independence numbers

Abstract

The structure of all triangle free graphs G = (V,E) with |E| - 6|V| + 13α(G) = 0 is determined, yielding an affirmative answer to a question of Stanisław Radziszowski and Donald Kreher.

arXiv commentLaTex, 24 pages

Cited by in corpus (2)

• Edge number report 1: State of the art estimates for $n\le 43$
• A computerised classification of some almost minimal triangle-free Ramsey graphs