The Clique Complex and Hypergraph Matching

Abstract

The width of a hypergraph F is the minimal t=w(F) for which there exist F1, . . . ,Ft∈F such that for any F ∈ F , Fi ∩F = ∅ for some 1≤ i≤ t. The matching width of F is the minimal t=mw(F) such that for any matching M⊂F there exist F1, . . . ,Ft∈F such that for any F ∈M, Fi∩F =∅ for some 1≤ i≤ t. The following extension of the Aharoni-Haxell matching… (More)
DOI: 10.1007/s004930170006

Topics

Cite this paper

@article{Meshulam2001TheCC, title={The Clique Complex and Hypergraph Matching}, author={Roy Meshulam}, journal={Combinatorica}, year={2001}, volume={21}, pages={89-94} }