Title of article :
Empty triangles in drawings of the complete graph Original Research Article
Author/Authors :
Heiko Harborth، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 1998
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
Journal title :
Discrete Mathematics
