Connected Components of Underlying Graphs of Halving Lines
Combinatorics
2013-04-23 v1
Abstract
In this paper we discuss the connected components of underlying graphs of halving lines' configurations. We show how to create a configuration whose underlying graph is the union of two given underlying graphs. We also prove that every connected component of the underlying graph is itself an underlying graph.
Cite
@article{arxiv.1304.5658,
title = {Connected Components of Underlying Graphs of Halving Lines},
author = {Tanya Khovanova and Dai Yang},
journal= {arXiv preprint arXiv:1304.5658},
year = {2013}
}
Comments
8 pages, 4 figures