Two combinatorial covering theorems
From MaRDI portal
Publication:1845725
DOI10.1016/0097-3165(74)90062-4zbMath0287.05002OpenAlexW2052333181MaRDI QIDQ1845725
Publication date: 1974
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(74)90062-4
Related Items (34)
Generalizations and strengthenings of Ryser's conjecture ⋮ On a combinatorial framework for fault characterization ⋮ Sperner capacities ⋮ Codes with given distances ⋮ Note on a problem of M. Talagrand ⋮ Approximating set multi-covers ⋮ On a theorem of Lovász on covers in \(r\)-partite hypergraphs ⋮ Strengthening hash families and compressive sensing ⋮ Approximately counting independent sets in bipartite graphs via graph containers ⋮ Detecting arrays for effects of single factors ⋮ Intersecting families of sets are typically trivial ⋮ Matrices of zeros and ones with fixed row and column sum vectors ⋮ An extension of Stein-Lovász theorem and some of its applications ⋮ System of unbiased representatives for a collection of bicolorings ⋮ A broadcast key distribution scheme based on block designs ⋮ On homomorphisms from the Hamming cube to \(\mathbb{Z}\) ⋮ The Constant Inapproximability of the Parameterized Dominating Set Problem ⋮ Asymptotic and constructive methods for covering perfect hash families and covering arrays ⋮ A general upper bound for 1-widths ⋮ Information theory and the complexity of boolean functions ⋮ Chromatic numbers of spheres ⋮ Covering compact metric spaces greedily ⋮ Partial covering arrays: algorithms and asymptotics ⋮ A Threshold Phenomenon for Random Independent Sets in the Discrete Hypercube ⋮ Bounds for the covering number of a graph ⋮ A covering theorem for quasi-groups ⋮ On some covering problems in geometry ⋮ On the capacity of Boolean graph formulæ ⋮ Matchings and covers in hypergraphs ⋮ A new proof of the Larman-Rogers upper bound for the chromatic number of the Euclidean space ⋮ A Simple Gap-Producing Reduction for the Parameterized Set Cover Problem ⋮ Bounds for optimal coverings ⋮ Asymptotic behavior of the chromatic index for hypergraphs ⋮ Upper Bounds on the Size of Covering Arrays
Cites Work
This page was built for publication: Two combinatorial covering theorems
