Fractional v. integral covers in hypergraphs of bounded edge size

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

P. Mark Kayll, Jeffry Kahn

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

hypergraphcovering of graphsfractional covers of graphsmatching of graphs

Mathematics Subject Classification ID

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

Related Items (3)

Graph and hypergraph colouring via nibble methods: a survey ⋮ An asymptotic bound for the strong chromatic number ⋮ On the stochastic independence properties of hard-core distributions

Cites Work

• 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
• 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
• [https://portal.mardi4nfdi.de/wiki/Publication:4870539 A linear programming perspective on the Frankl?R�dl?Pippenger theorem]
• Maximum matching and a polyhedron with 0,1-vertices
• A normal law for matchings

This page was built for publication: Fractional v. integral covers in hypergraphs of bounded edge size