Title of article
Empty triangles in drawings of the complete graph Original Research Article
Author/Authors
Heiko Harborth، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1998
Pages
3
From page
109
To page
111
Abstract
If t(n) denotes the minimum number of empty triangles in all drawings of the complete graph of order n then t(n) ⩽ 2n − 4 is proved and t(n) ⩾ 2n3 is conjectured.
Journal title
Discrete Mathematics
Serial Year
1998
Journal title
Discrete Mathematics
Record number
951186
Link To Document