Hypergraphs with no special cycles

DOI10.1007/BF02579287zbMath0526.05043OpenAlexW2027302071MaRDI QIDQ594899

Richard P. Anstee

Publication date: 1983

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02579287

zbMATH Keywords

incidence matrix(0,1)-matrixcycles in hypergraphs

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10)

Related Items (14)

Strong unimodularity for matrices and hypergraphs ⋮ On hypergraph acyclicity and graph chordality ⋮ Binary set systems and totally balanced hypergraphs ⋮ Feedback vertex sets on restricted bipartite graphs ⋮ On the complexity of the black-and-white coloring problem on some classes of perfect graphs ⋮ Stability and venture structures in multilateral matching ⋮ The Multilinear Polytope for Acyclic Hypergraphs ⋮ Berge-acyclic multilinear 0-1 optimization problems ⋮ On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs ⋮ Totally balanced dissimilarities ⋮ Characterizations of strongly chordal graphs ⋮ The network flows approach for matrices with given row and column sums ⋮ Hypergraphs without a large star ⋮ A characterization of totally balanced hypergraphs

Cites Work

• The network flows approach for matrices with given row and column sums
• Properties of (0,1)-matrices with no triangles
• Properties of (0,1)-matrices without certain configurations
• The number of labeled k-dimensional trees
• A Fundamental Matrix Equation for Finite Sets

This page was built for publication: Hypergraphs with no special cycles