TURAN TYPE PROBLEM FOR INTERVAL GRAPHS

被引：8

作者：

ABBOTT, H

KATCHALSKI, M

机构：

[1] Department of Mathematics, University of Alberta, Edmonton

来源：

DISCRETE MATHEMATICS | 1979年 / 25卷 / 01期

关键词：

D O I：

10.1016/0012-365X(79)90155-9

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We consider the following analogue of a problem of Turán for interval graphs: Let c = c(n, m) be the largest integer such that any interval graph with n vertices and at least m edges contains a complete subgraph on c vertices. We determine the value of c(n, m) explicitly. © 1979.

引用

页码：85 / 88

页数：4