On crossing families of complete geometric graphs
Combinatorics
2019-04-08 v2
Abstract
A crossing family is a collection of pairwise crossing segments, this concept was introduced by Aronov et. al. (1994). They prove that any set of points (in general position) in the plain contains a crossing family of size . In this paper we present a generalization of the concept and give several results regarding this generalization.
Cite
@article{arxiv.1805.09888,
title = {On crossing families of complete geometric graphs},
author = {Dolores Lara and Christian Rubio-Montiel},
journal= {arXiv preprint arXiv:1805.09888},
year = {2019}
}
Comments
23 pages, 16 figures