pith. sign in

arxiv: 1610.05039 · v1 · pith:3MML4P7Rnew · submitted 2016-10-17 · 🧮 math.CO

The odd-even invariant and Hamiltonian circuits in tope graphs

classification 🧮 math.CO
keywords circuitshamiltonianinvariantodd-evenresultsarrangementexistencegraphs
0
0 comments X
read the original abstract

In this paper we consider the question of the existence of Hamiltonian circuits in the tope graphs of central arrangements of hyperplanes. Some of the results describe connections between the existence of Hamiltonian circuits in the arrangement and the odd-even invariant of the arrangement. In conjunction with this, we present some results concerning bounds on the odd-even invariant. The results given here can be formulated more generally for oriented matroids and are still valid in that setting.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.