, Volume 12, Issue 2, pp 155-160

A fractional version of the Erdős-Faber-Lovász conjecture

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


LetH be any hypergraph in which any two edges have at most one vertex in common. We prove that one can assign non-negative real weights to the matchings ofH summing to at most |V(H)|, such that for every edge the sum of the weights of the matchings containing it is at least 1. This is a fractional form of the Erdős-Faber-Lovász conjecture, which in effect asserts that such weights exist and can be chosen 0,1-valued. We also prove a similar fractional version of a conjecture of Larman, and a common generalization of the two.

Supported in part by NSF grant MCS 83-01867, AFOSR Grant 0271 and a Sloan Research Fellowship