The following pages link to On a packing and covering problem (Q1058516):
Displayed 50 items.
- Asymptotic behavior of the chromatic index for hypergraphs (Q805633) (← links)
- Covering pairs by \(q^ 2+q+1\) sets (Q810520) (← links)
- Lower bounds for coverings of pairs by large blocks (Q910408) (← links)
- Coding for a multiple access OR channel: A survey (Q947083) (← links)
- Asymptotically optimal frugal colouring (Q965250) (← links)
- Hamiltonian cycles in Dirac graphs (Q987558) (← links)
- Random constructions and density results (Q1009013) (← links)
- Two-regular subgraphs of hypergraphs (Q1026004) (← links)
- Triangle packings and 1-factors in oriented graphs (Q1026012) (← links)
- The minimum likely column cover problem (Q1029075) (← links)
- The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent (Q1076037) (← links)
- All rationals occur as exponents (Q1082340) (← links)
- Probabilistic methods (Q1091406) (← links)
- Near perfect coverings in graphs and hypergraphs (Q1092067) (← links)
- Forbidden submatrices (Q1103620) (← links)
- Exact solution of some Turán-type problems (Q1112819) (← links)
- The number of \(t\)-wise balanced designs (Q1180422) (← links)
- Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors (Q1185879) (← links)
- Near-optimal, distributed edge colouring via the nibble method (Q1274333) (← links)
- Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping (Q1281767) (← links)
- Vertex-disjoint claws in graphs (Q1292832) (← links)
- Probabilistic methods in coloring and decomposition problems (Q1322212) (← links)
- Packing of partial designs (Q1323485) (← links)
- On the upper bound of the size of the \(r\)-cover-free families (Q1328402) (← links)
- On the difference between asymptotically good packings and coverings (Q1345524) (← links)
- Fractional v. integral covers in hypergraphs of bounded edge size (Q1356038) (← links)
- Nearly perfect matchings in regular simple hypergraphs (Q1366948) (← links)
- Connected coverings and an application to oriented matroids (Q1584290) (← links)
- Almost disjoint families of 3-term arithmetic progressions (Q1763874) (← links)
- Bounds on the sizes of constant weight covering codes (Q1804978) (← links)
- Matchings and covers in hypergraphs (Q1813100) (← links)
- Bounding the strong chromatic index of dense random graphs (Q1827703) (← links)
- Bounds for optimal coverings (Q1827869) (← links)
- Graph imperfection. II (Q1850632) (← links)
- What we know and what we do not know about Turán numbers (Q1895823) (← links)
- On two set-systems with restricted cross-intersections (Q1902973) (← links)
- Large independent sets in regular graphs of large girth (Q2384807) (← links)
- Minimum \(H\)-decompositions of graphs (Q2384810) (← links)
- On a hypergraph matching problem (Q2494110) (← links)
- A novel use of \(t\)-packings to construct \(d\)-disjunct matrices (Q2499596) (← links)
- Asymptotically optimal \(K_k\)-packings of dense graphs via fractional \(K_k\)-decompositions (Q2565683) (← links)
- On the size of partial block designs with large blocks (Q2581419) (← links)
- (Q2713359) (← links)
- The effect of induced subgraphs on quasi-randomness (Q3055880) (← links)
- Fractional decompositions of dense hypergraphs (Q3429620) (← links)
- Note on asymptotically good packings (Q3578141) (← links)
- Forbidden Intersections (Q3751579) (← links)
- Bounds on the Maximum Number of Vectors with given Scalar Products (Q3784099) (← links)
- New constructions for covering designs (Q4373370) (← links)
- (Q4500484) (← links)