Fractional v. integral covers in hypergraphs of bounded edge size

DOI10.1006/jcta.1997.2761zbMath0884.05067MaRDI QIDQ1356038

Jeffry Kahn, P. Mark Kayll

Publication date: 28 January 1998

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcta.1997.2761

zbMATH Keywords

hypergraph; covering of graphs; fractional covers of graphs; matching of graphs

Mathematics Subject Classification ID

05C65: Hypergraphs

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

Related Items

On the stochastic independence properties of hard-core distributions

Cites Work

• Asymptotic behavior of the chromatic index for hypergraphs
• On a packing and covering problem
• Asymptotically good coverings
• Matching theory
• Near perfect coverings in graphs and hypergraphs
• More-than-nearly-perfect packings and partial designs
• Asymptotics of the chromatic index for multigraphs
• A dense infinite Sidon sequence
• Extremal uncrowded hypergraphs
• On the combinatorial problems which I would most like to see solved
• On the stochastic independence properties of hard-core distributions
• Percolation and the hard-core lattice gas model
• Nearly perfect matchings in regular simple hypergraphs
• Matchings and covers in hypergraphs
• Asymptotically good list-colorings
• Theory of monomer-dimer systems
• A Lower Bound for Heilbronn'S Problem
• On a Problem of Erdos and Lovasz. II: n(r) = O(r)
• Asymptotic packing via a branching process
• The Ramsey number R(3, t) has order of magnitude t²/log t
• On Brooks' Theorem for Sparse Graphs
• Maximum matching and a polyhedron with 0,1-vertices
• A normal law for matchings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item