The feasible matching problem

DOI10.1007/S00373-012-1141-7MaRDI QIDQ2376094zbMATH OpenOpenAlexFDO

Authors Yuejian Peng, Papa A. Sissokho

Publication date 26 June 2013

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-012-1141-7

zbMATH Keywords

feasible coverfeasible matchingRyser's conjecturesystem of disjoint representatives

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• R-feasible matching problem on R-bipartite graphs
• Coverings and matchings in r-partite hypergraphs
• Nonintersecting Ryser Hypergraphs
• Hall's theorem for hypergraphs
• Generalizations and strengthenings of Ryser's conjecture

Cites work

• Hall's theorem for hypergraphs
• scientific article; zbMATH DE number 3884213 (Why is no real title available?)
• scientific article; zbMATH DE number 3020563 (Why is no real title available?)
• Maximum degree and fractional matchings in uniform hypergraphs
• On Representatives of Subsets
• Ryser's conjecture for tripartite 3-graphs

Cited in

(3)

• An unfeasible matching problem
• The Euclidean Matching Problem
• R-feasible matching problem on R-bipartite graphs

This page was built for publication: The feasible matching problem

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