Let '$(G) denote the fractional chromatic index of a graph G. Let M(G) be a family of matchings of G such that M # M(G) if and only if there exists a fractional '$(G)-edge colouring of G in which M is a colour class. We use Lova sz's matching lattice theorem to obtain a description of the lattice ge
A class of multipartner matching markets with a strong lattice structure
โ Scribed by Ahmet Alkan
- Publisher
- Springer
- Year
- 2002
- Tongue
- English
- Weight
- 75 KB
- Volume
- 19
- Category
- Article
- ISSN
- 0938-2259
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
For every hypergraph on n vertices there is an associated subspace arrangement in R n called a hypergraph arrangement. We prove shellability for the intersection lattices of a large class of hypergraph arrangements. This class incorporates all the hypergraph arrangements which were previously shown
A Lattice L(X) is defined starting from a cubical lattice L and an increasing diagonally closed subset X of L (Section 1). The lattice L(X) are proved to be--up to isomorphism--precisely those of signed simplexes of a simplical complex (Section 2); furthermore, an algebraic combinatorial characteriz