Fractional v. integral covers in hypergraphs of bounded edge size
From MaRDI portal
Publication:1356038
DOI10.1006/JCTA.1997.2761zbMATH Open0884.05067OpenAlexW2061632191MaRDI QIDQ1356038FDOQ1356038
Authors: P. Mark Kayll, J. 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
Recommendations
- A linear programming perspective on the Frankl?R�dl?Pippenger theorem
- Optimal fractional matchings and covers in infinite hypergraphs: existence and duality
- Partial covering of hypergraphs
- On the number of copies of one hypergraph in another
- Strong LP duality in weighted infinite bipartite graphs
- Approximate Set Covering in Uniform Hypergraphs
- Some remarks on hypergraph matching and the Füredi–Kahn–Seymour conjecture
- ECONOMICAL COVERS WITH GEOMETRIC APPLICATIONS
- Distributed Fractional Packing and Maximum Weighted b-Matching via Tail-Recursive Duality
- Fractional matchings and covers in infinite hypergraphs
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- Matching theory
- Theory of monomer-dimer systems
- On a packing and covering problem
- On the combinatorial problems which I would most like to see solved
- Percolation and the hard-core lattice gas model
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Brooks' Theorem for Sparse Graphs
- Maximum matching and a polyhedron with 0,1-vertices
- Near perfect coverings in graphs and hypergraphs
- The Ramsey number R(3, t) has order of magnitude t2/log t
- A normal law for matchings
- Asymptotic behavior of the chromatic index for hypergraphs
- Extremal uncrowded hypergraphs
- More-than-nearly-perfect packings and partial designs
- Matchings and covers in hypergraphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Asymptotics of the chromatic index for multigraphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- A dense infinite Sidon sequence
- Title not available (Why is that?)
- Nearly perfect matchings in regular simple hypergraphs
- Asymptotically good list-colorings
- Title not available (Why is that?)
- On a Problem of Erdos and Lovasz. II: n(r) = O(r)
- Asymptotically good coverings
- A Lower Bound for Heilbronn'S Problem
- On the stochastic independence properties of hard-core distributions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Asymptotic packing via a branching process
- A linear programming perspective on the Frankl?R�dl?Pippenger theorem
Cited In (16)
- On the fractional matching polytope of a hypergraph
- A stability theorem on fractional covering of triangles by edges
- A generalisation of matching and colouring
- Optimal fractional matchings and covers in infinite hypergraphs: existence and duality
- Solution of two fractional packing problems of Lovász. (Reprint)
- Hypergraph families with bounded edge cover or transversal number
- On the Fractional Covering Number of Hypergraphs
- An asymptotic bound for the strong chromatic number
- On the stochastic independence properties of hard-core distributions
- Title not available (Why is that?)
- Edge-covers in \(d\)-interval hypergraphs
- Graph and hypergraph colouring via nibble methods: a survey
- Some combinatorial algorithms on the edge cover number of \(k\)-regular connected hypergraphs
- Weighted fractional and integral \(k\)-matching in hypergraphs
- A Sharp Bound on the Ratio Between Optimal Integer and Fractional Covers
- Fractional covers and matchings in families of weighted \(d\)-intervals
This page was built for publication: Fractional v. integral covers in hypergraphs of bounded edge size
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1356038)
