volume 28, issue 4, P577-583 2002
DOI: 10.1007/s00454-002-2888-z
View full text
|
|
Share

Abstract: Two triangles are called almost disjoint if they are either disjoint or their intersection consists of one common vertex. Let f (n) denote the maximum number of pairwise almost disjoint triangles that can be found on some vertex set of n points in 3-space. Here we prove that f (n) = (n 3/2 ).

Search citation statements

Order By: Relevance

Paper Sections

0
0
0
0
0

Citation Types

0
1
0

Publication Types

Select...

Relationship

0
0

Authors

Journals