A note on exact minimum degree threshold for fractional perfect matchings (Q2124789)

A \(k\)-uniform hypergraph \(H\) or simply a \(k\)-graph is a generalization of a graph in which each hyperedge is a subset of \(V(H)\) of cardinality \(k\). A fractional matching in a hypergraph \(H\) is a function that assigns a fraction in \([0,1]\) to each hyperedge, such that for every vertex \(v \in V(H)\), the sum of fractions of hyperedges containing \(v\) is at most 1. The size of a fractional matching is the sum of fractions of all hyperedges. The fractional matching number of a hypergraph \(H\) is the largest size of a fractional matching in \(H\). For integers \(n\), \(k\), \(d\) and positive rational number \(s\) satisfying \(0\leq d\leq k-1\) and \(s\leq n\slash k\), let \(f_d^{s}(k,n)\) denote the minimum integer \(m\) such that every \(k\)-graph \(H\) on \(n\) vertices with the minimum \(d\)-degree greater or equal to \(m \) has a fractional matching of size \(s\). In this note, based on the results of \textit{P. Frankl} and \textit{A. Kupavskii} [``The Erdős matching conjecture and concentration inequalities'', Preprint, \url{arXiv:1806.08855}], the exact value of \(f_d^{n\slash k}(k,n)\) for certain ranges of \(d\) is determined.