Oriented Hypergraphs I: Introduction and Balance
Combinatorics
2016-01-21 v1
Abstract
An oriented hypergraph is an oriented incidence structure that extends the concept of a signed graph. We introduce hypergraphic structures and techniques central to the extension of the circuit classification of signed graphs to oriented hypergraphs. Oriented hypergraphs are further decomposed into three families -- balanced, balanceable, and unbalanceable -- and we obtain a complete classification of the balanced circuits of oriented hypergraphs.
Keywords
Cite
@article{arxiv.1210.0943,
title = {Oriented Hypergraphs I: Introduction and Balance},
author = {Lucas J. Rusnak},
journal= {arXiv preprint arXiv:1210.0943},
year = {2016}
}
Comments
29 pages, 8 figures