Fractional Hypergraph Matchings is a mathematical construct in hypergraph theory where a matching is represented as a non-negative real-valued function on the hyperedges such that the sum of values over all hyperedges incident to any given vertex does not exceed one, generalizing classical matchings by allowing fractional assignments instead of binary selections.
9
Publications
353
Citations
17
Authors
10
Institutions
Publications per year
2017–2026
2
Parents
Publications
9
Maximum degree and fractional matchings in uniform hypergraphs
Zoltán Füredi · COMBINATORICA · 1981 · 135 citations
On the fractional matching polytope of a hypergraph
Z. F�redi, J. Kahn, Paul Seymour · COMBINATORICA · 1993 · 47 citations
1–5 of 9
Authors
17
- JK
2
h-index
- ZF
1
h-index
- MK
1
h-index
- BN
1
h-index
- KE
1
h-index
1–5 of 17
Institutions
10
Rutgers, The State University of New Jersey
New Brunswick, United States
3 h-index
4 publications
131 citations
Hungarian Academy of Sciences
Budapest, Hungary
2 h-index
2 publications
182 citations
University of Rostock
Rostock, Germany
1 h-index
1 publications
37 citations
Tel Aviv University
Tel Aviv, Israel
1 h-index
1 publications
13 citations
National University of Defense Technology
Changsha, China
1 h-index
2 publications
44 citations
University of Illinois Urbana-Champaign
Urbana, United States
1 h-index
1 publications
47 citations
Stanford University
Stanford, United States
1 h-index
1 publications
26 citations
University of Birmingham
Birmingham, United Kingdom
1 h-index
3 publications
90 citations
1–8 of 10
Venues
- Random Structures and Algorithms
2 publications · 45 citations
2
h-index
- COMBINATORICA
2 publications · 182 citations
2
h-index
- Discrete Mathematics
1 publications · 22 citations
1
h-index
- Combinatorics Probability Computing
1 publications · 37 citations
1
h-index
- Annals of Mathematics
1 publications · 26 citations
1
h-index
1–5