Kemper, Y.
and Lawrence, J.
(2017),
The odd-even invariant and Hamiltonian circuits in tope graphs, European Journal of Combinatorics, [online], https://doi.org/10.1016/j.ejc.2017.10.002
(Accessed May 1, 2025)
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
Secure .gov websites use HTTPS
A lock (
) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.
The odd-even invariant and Hamiltonian circuits in tope graphs
Published
Author(s)
Yvonne Kemper,
Abstract
Questions of the existence of Hamiltonian circuits in the tope graphs of central arrangements of hyperplanes are considered. Connections between the existence of Hamiltonian circuits in the arrangement and the odd-even invariant of the arrangement are described. Some new results concerning bounds on the odd-even invariant are obtained. All results can be formulated more generally for oriented matroids and are still valid in that setting.Citation
European Journal of Combinatorics
Volume
69
Pub Type
Journals
Download Paper
Keywords
Hamiltonian circuit, arrangement of hyperplanes, oriented matroid
Citation
Issues
If you have any questions about this publication or are having problems accessing it, please contact reflib@nist.gov.
Created October 26, 2017, Updated October 12, 2021