A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
On Convex Geometric Graphs with no k+1 Pairwise Disjoint Edges
[article]

2015
*
arXiv
*
pre-print

A well-known result of Kupitz from 1982 asserts that the maximal number of edges in a convex geometric graph (CGG) on n vertices that does not contain k+1 pairwise disjoint edges is kn (provided n>2k). For k=1 and k=n/2-1, the extremal examples are completely characterized. For all other values of k, the structure of the extremal examples is far from known: their total number is unknown, and only a few classes of examples were presented, that are almost symmetric, consisting roughly of the kn

arXiv:1405.4019v2
fatcat:qjtg7vwa6jb7zfrzufn6uyn7ge