|
|||||
 |
|
|
|
|
|
On
halving-edges graphs
Tanya Khovanova and Dai Yang
Vol. 11 (2018), No. 1, 1–11
DOI: 10.2140/involve.2018.11.1
|
Abstract |
|
In this paper we study halving-edges graphs corresponding to a set of halving lines. Particularly, we study the vertex degrees, path, cycles and cliques of such graphs. In doing so, we study a vertex-partition of said graph called chains which are equipped with interesting properties. |
PDF Access Denied
We have not been able to recognize your IP address
18.206.48.243
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our journal-recommendation form. Or, visit our subscription page for instructions on purchasing a subscription.
You may also contact us at
contact@msp.org
or by using our
contact form.
Or, you may purchase this single article for USD 30.00:
Keywords
combinatorics, halving lines, combinatorial geometry,
discrete math
|
Mathematical Subject Classification 2010
Primary: 05C30
|
Milestones
Received: 28 April 2013
Revised: 28 September 2014
Accepted: 17 October 2016
Published: 17 July 2017
Communicated by Kenneth S. Berenhaut
|
Authors |
| Tanya Khovanova | |
| Department of Mathematics MIT 77 Massachusetts Ave Cambridge, MA 20139 United States |
|
| Dai Yang | |
| Department of Mathematics MIT 575 S Rengstorff Mountain View, CA 94040 United States |
|
|
