Maximal triangle‐free graphs with restrictions on the degrees
作者:
Zoltán Füredi,
Ákos Seress,
期刊:
Journal of Graph Theory
(WILEY Available online 1994)
卷期:
Volume 18,
issue 1
页码: 11-24
ISSN:0364-9024
年代: 1994
DOI:10.1002/jgt.3190180103
出版商: Wiley Subscription Services, Inc., A Wiley Company
数据来源: WILEY
摘要:
AbstractWe investigate the problem that at least how many edges must a maximal triangle‐free graph onnvertices have if the maximal valency is ≤D. Denote this minimum value byF(n, D). For large enoughn, we determine the exact value ofF(n, D) ifD≥ (n− 2)/2 and we prove that limF(n, cn)/n = K(c) exists for all 0
点击下载:
PDF
(645KB)
返 回