On the König-Hall-Egerváry theorem for multidimensional matrices and multipartite hypergraphs

DOI10.1016/j.disc.2021.112447zbMath1466.05188arXiv1811.09981OpenAlexW3159371017MaRDI QIDQ2032871

Anna A. Taranenko

Publication date: 14 June 2021

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

extremal matrixmultidimensional matrixfractional matching in hypergraphKönig-Hall-Egerváry theorem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Basic linear algebra (15A99)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On Ryser's conjecture
• On the fractional matching polytope of a hypergraph
• Extremal hypergraphs for Ryser's conjecture
• A theorem on flows in networks
• Ryser's conjecture for tripartite 3-graphs
• Vector transversals
• Uniqueness of solution in linear programming
• Transversals, plexes, and multiplexes in iterated quasigroups
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Perfect matchings in \(r\)-partite \(r\)-graphs
• The Size of a Hypergraph and its Matching Number
• Combinatorial Properties of Matrices of Zeros and Ones
• Encyclopedia of Optimization
• Hall's theorem for hypergraphs
• A geometric theory for hypergraph matching

This page was built for publication: On the König-Hall-Egerváry theorem for multidimensional matrices and multipartite hypergraphs