Pages that link to "Item:Q1845725"
From MaRDI portal
The following pages link to Two combinatorial covering theorems (Q1845725):
Displaying 29 items.
- Covering compact metric spaces greedily (Q722361) (← links)
- Partial covering arrays: algorithms and asymptotics (Q726106) (← links)
- Asymptotic behavior of the chromatic index for hypergraphs (Q805633) (← links)
- Codes with given distances (Q1094390) (← links)
- Matrices of zeros and ones with fixed row and column sum vectors (Q1146695) (← links)
- A general upper bound for 1-widths (Q1214935) (← links)
- Bounds for the covering number of a graph (Q1252353) (← links)
- A covering theorem for quasi-groups (Q1254625) (← links)
- On homomorphisms from the Hamming cube to \(\mathbb{Z}\) (Q1425648) (← links)
- On a combinatorial framework for fault characterization (Q1616211) (← links)
- Asymptotic and constructive methods for covering perfect hash families and covering arrays (Q1741930) (← links)
- Chromatic numbers of spheres (Q1783626) (← links)
- On the capacity of Boolean graph formulæ (Q1805371) (← links)
- Matchings and covers in hypergraphs (Q1813100) (← links)
- Bounds for optimal coverings (Q1827869) (← links)
- On a theorem of Lovász on covers in \(r\)-partite hypergraphs (Q1924486) (← links)
- Strengthening hash families and compressive sensing (Q1932362) (← links)
- An extension of Stein-Lovász theorem and some of its applications (Q1945692) (← links)
- Generalizations and strengthenings of Ryser's conjecture (Q2121724) (← links)
- System of unbiased representatives for a collection of bicolorings (Q2201776) (← links)
- A new proof of the Larman-Rogers upper bound for the chromatic number of the Euclidean space (Q2309559) (← links)
- Sperner capacities (Q2366215) (← links)
- Approximating set multi-covers (Q2408974) (← links)
- On some covering problems in geometry (Q2809209) (← links)
- A Threshold Phenomenon for Random Independent Sets in the Discrete Hypercube (Q3068811) (← links)
- A Simple Gap-Producing Reduction for the Parameterized Set Cover Problem (Q5091240) (← links)
- Approximately counting independent sets in bipartite graphs via graph containers (Q6074723) (← links)
- Detecting arrays for effects of single factors (Q6086392) (← links)
- Intersecting families of sets are typically trivial (Q6144393) (← links)
