The fractional edge-cover number of a finite hypergraph
with no isolated vertices is the minimum total
nonnegative weight on its hyperedges
such that the weights incident with every vertex sum to at least 1 (Friedgut and
Kahn 1998). Thus
It is a linear programming relaxation of the edge cover number. Allowing weights can reduce
the value. For the triangle graph, weights
on all three edges give
, while the edge
cover number is 2.
By linear programming duality, the same value is
For an ordinary graph without isolated vertices, this is its edge-constraint fractional
independence number .
The fractional edge-cover number controls the exponent in extremal subgraph
counts.