Let F(n,D) be the minimum number of edges of a maximal triangle-free graph on n vertices having maximal degree at most D. By continuing work done by Z. Füredi and Á. Seress, it is proven that

lim_{n ––> oo} {F(n,cn)\over n} = | (11- 7c)/2 for ^{3}/_{7} \leq c < ^{1}/_{2} |

4 for ^{2}/_{5} \leq c \leq ^{3}/_{7} |

05C65 Hypergraphs

90C05 Linear programming

© European Mathematical Society & FIZ Karlsruhe & Springer-Verlag