Oriented hypergraphs: balanceability

DOI10.1016/J.DISC.2022.112832MaRDI QIDQ2124629zbMATH OpenOpenAlexFDO

Authors Lucas J. Rusnak, Selena Li, Brian Xu, Eric Yan, Shirley Zhu

Publication date 11 April 2022

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2005.07722

zbMATH Keywords

signed graphbalanced matrixbalanced hypergraphoriented hypergraphbalancing sets

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Hypergraphs (05C65)

Abstract: An oriented hypergraph is an oriented incidence structure that extends the concepts of signed graphs, balanced hypergraphs, and balanced matrices. We introduce hypergraphic structures and techniques that generalize the circuit classification of the signed graphic frame matroid to any oriented hypergraphic incidence matrix via its locally-signed-graphic substructure. To achieve this, Camion's algorithm is applied to oriented hypergraphs to provide a generalization of reorientation sets and frustration that is only well-defined on balanceable oriented hypergraphs. A simple partial characterization of unbalanceable circuits extends the applications to representable matroids demonstrating that the difference between the Fano and non-Fano matroids is one of balance.

Recommendations

• Oriented hypergraphs: introduction and balance
• A characterization of oriented hypergraphic balance via signed weak walks
• An oriented hypergraphic approach to algebraic graph theory
• Intersection graphs of oriented hypergraphs and their matrices
• Spectra of cycle and path families of oriented hypergraphs

Cites work

• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 1380573 (Why is no real title available?)
• scientific article; zbMATH DE number 7352045 (Why is no real title available?)
• scientific article; zbMATH DE number 3327126 (Why is no real title available?)
• scientific article; zbMATH DE number 3409134 (Why is no real title available?)
• A characterization of oriented hypergraphic Laplacian and adjacency matrix coefficients
• A characterization of oriented hypergraphic balance via signed weak walks
• Alpha-balanced graphs and matrices and GF(3)-representability of matroids
• An oriented hypergraphic approach to algebraic graph theory
• Balanced matrices
• Characterization of Totally Unimodular Matrices
• Characterizing attitudinal network graphs through frustration cloud
• Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
• Decomposition of balanced matrices
• Incidence hypergraphs: injectivity, uniformity, and matrix-tree theorems
• Orientation of signed graphs
• Oriented hypergraphic matrix-tree type theorems and bidirected minors via Boolean order ideals
• Oriented hypergraphs: introduction and balance
• Spectra of cycle and path families of oriented hypergraphs
• Spectral properties of oriented hypergraphs

Cited in

(5)

• Recent results on well-balanced orientations
• Oriented hypergraphs: introduction and balance
• On the most imbalanced orientation of a graph
• A characterization of oriented hypergraphic balance via signed weak walks
• Intersection graphs of oriented hypergraphs and their matrices

Describes a project that uses

Uses Software

• graphB
• Leibniz

This page was built for publication: Oriented hypergraphs: balanceability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2124629)