@article{Abbott1979ATT,
title={A Tur{\'a}n type problem for interval graphs},
author={Harvey L. Abbott and Meir Katchalski},
journal={Discrete Mathematics},
year={1979},
volume={25},
pages={85-88}
}

We consider in this paper an interval graph analogue of Turin’s theorem in extremal graph theory. We first mention brieiiy some notation and terminology. The graphs to be discussed are ail finite and without multiple edges or loops. E(G) and V(G) denote the sets of edges and vertices of a graph G. K,, denotes the complete graph on n vertices. A cycle is a circuit in which no vertices are repeated. A chord is an edge joining two nonconsecutive vertices of a cycle. A graph is reducible if each of… CONTINUE READING