DIRECTED TRIANGLES IN DIRECTED-GRAPHS

被引:10
|
作者
DEGRAAF, M
SCHRIJVER, A
SEYMOUR, PD
机构
[1] CWI,KRUISLAAN 413,1098 SJ AMSTERDAM,NETHERLANDS
[2] UNIV AMSTERDAM,DEPT MATH,1018 TV AMSTERDAM,NETHERLANDS
[3] BELLCORE,MORRISTOWN,NJ 07960
关键词
D O I
10.1016/0012-365X(92)90719-V
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We show that each directed graph on n vertices, each with indegree and out degree at least n/t, where t = 5 - square-root 5 + 1/2 square-root 47 - 21 square-root 5 = 2.8670975 ..., contains a directed circuit of length at most 3.
引用
收藏
页码:279 / 282
页数:4
相关论文
共 50 条