SIAM Journal on Discrete Mathematics · 1988 · 29 citations · 6 references
Natural SciencesMathematicsCombinatoricsComputational GeometryNumber TheoryCombinatorial Number TheoryGraph TheoryHypergraph TheoryFractional Hypergraph CoveringsUniform Hypergraphs
The fractional covering number$\tau^*$ of a hypergraph $H = ( V, E )$ is defined to be the minimum possible value of $\sum_{x \in V} t( x )$ where t ranges over all functions $t : V \to \mathbb{R}$ which satisfy $\sum_{x \in e} t ( x ) \geqq 1$ for all edges $e \in E$. In the case of ordinary graphs G, it is known that $2\tau^* ( G )$ is always an integer. By contrast, it is shown (among other things) that for any rational $p/q\geqq 1$, there is a 3-uniform hypergraph H with $\tau^* ( H ) = p/q$.
6
Maximum degree and fractional matchings in uniform hypergraphs
Zoltán Füredi · COMBINATORICA · 1981 · 135 citations
The 1-factors of oriented graphs
W. T. Tutte · Proceedings of the American Mathematical Society · 1953 · 110 citations · Full text
Establishing the matching polytope
Michel Balinski · Journal of Combinatorial Theory Series B · 1972 · 43 citations