Fractional Hypergraph Coverings
Fractional Hypergraph Coverings is a mathematical framework in hypergraph theory that generalizes classical vertex coverings by assigning non-negative real weights to vertices such that the sum of weights over vertices incident to any hyperedge is at least one, thereby enabling optimization through linear programming relaxation.
3
Publications
58
Citations
10
Authors
5
Institutions
Publications per year
2017–2026
0
Parents
3
On the Fractional Covering Number of Hypergraphs
Fan Chung, Zoltán Füredi, M. R. Garey et al. · SIAM Journal on Discrete Mathematics · 1988 · 29 citations
Integer and fractional packings of hypergraphs
V. Rödl, Mathias Schacht, Mark Siggers et al. · Journal of Combinatorial Theory Series B · 2006 · 16 citations
1–3 of 3
10
1
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 10
5
Emory University
Atlanta, United States
1 h-index
2 publications
32 citations

University of Montana
Missoula, United States
1 h-index
1 publications
13 citations
Rutgers, The State University of New Jersey
New Brunswick, United States
1 h-index
1 publications
13 citations

University of the Ryukyus
Okinawa, Japan
1 h-index
1 publications
16 citations
Humboldt-Universität zu Berlin
Berlin, Germany
1 h-index
1 publications
16 citations
1–5 of 5
1 publications · 29 citations
1
h-index
1 publications · 13 citations
1
h-index
1 publications · 16 citations
1
h-index
1–3