arXiv (OAI Expanded)
open access
Characterizing unimodular laminar hypergraphs via forbidden subhypergraphs
The incidence matrix of a graph is totally unimodular if and only if the graph is bipartite, i.e., it contains no odd cycles. We extend the characterization of total unimodularity to hypergraphs whose hyperedges of size at least four form a laminar family. Such hypergraphs have been used to model pr
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Sublinear Algorithms for Estimating the Number of Hyperedges in Arbitrary Hypergraphs#659123
- Sublinear Algorithms for Estimating the Number of Hyperedges in Arbitrary Hypergraphs#656987
- Median eigenvalues of subcubic graphs#612764
- Median eigenvalues of subcubic graphs#611287
- Generating the symmetric group by three prefix reversals#820283
Record · ID 1083985
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive