Date of Original Version

12-2009

Type

Article

Rights Management

© by International Press of Boston

Abstract or Description

A graph G is called \emph{F-saturated} if it is F-free but theaddition of any missing edge to G creates a copy of F.Let the saturation function \sat(n,F) be the minimum numberof edges that an F-saturated graph on n vertices can have.We determine this function asymptotically forevery fixed complete partite graph F as n tends to infinity andgive some structural information aboutalmost extremal F-saturated graphs.If the two largest parts of F have different sizes,then we can reduce the error term to an additive constant.

DOI

10.4310/JOC.2010.v1.n2.a5

Included in

Mathematics Commons

Share

COinS
 

Published In

Journal of Combinitorics, 1, 2, 149-170.