Edge number critical triangle free graphs with low independence numbers
Combinatorics
2013-10-01 v1
Abstract
The structure of all triangle free graphs G = (V,E) with |E| - 6|V| + 13\alpha(G) = 0 is determined, yielding an affirmative answer to a question of Stanis{\l}aw Radziszowski and Donald Kreher.
Keywords
Cite
@article{arxiv.1309.7874,
title = {Edge number critical triangle free graphs with low independence numbers},
author = {Jörgen Backelin},
journal= {arXiv preprint arXiv:1309.7874},
year = {2013}
}
Comments
LaTex, 24 pages