The following pages link to On a packing and covering problem (Q1058516):
Displaying 50 items.
- Independence numbers and chromatic numbers of some distance graphs (Q259909) (← links)
- An approximate version of the tree packing conjecture (Q273108) (← links)
- Nearly-perfect hypergraph packing is in NC (Q286955) (← links)
- On a combinatorial problem for the set of binary vectors (Q307873) (← links)
- New bounds for the distance Ramsey number (Q393923) (← links)
- Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths (Q397075) (← links)
- Supersaturation for hereditary properties (Q412233) (← links)
- Combinatorial and computational aspects of graph packing and graph decomposition (Q458446) (← links)
- Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
- Optimal covers with Hamilton cycles in random graphs (Q484550) (← links)
- On a covering problem in the hypercube (Q489361) (← links)
- A note on supersaturated set systems (Q499460) (← links)
- Tight cycles and regular slices in dense hypergraphs (Q516070) (← links)
- Unavoidable subhypergraphs: \(\mathbf a\)-clusters (Q640838) (← links)
- The existence of \(k\)-radius sequences (Q645973) (← links)
- Generalising Fisher's inequality to coverings and packings (Q681600) (← links)
- Forbidden configurations and Steiner designs (Q690672) (← links)
- Constructions and bounds for separating hash families (Q724890) (← links)
- Hypergraph extensions of the Erdős-Gallai theorem (Q739066) (← links)
- Invitation to intersection problems for finite sets (Q739389) (← links)
- On the realization of subgraphs of a random graph by diameter graphs in Euclidean spaces (Q745606) (← links)
- Arboricity: an acyclic hypergraph decomposition problem motivated by database theory (Q765344) (← links)
- Asymptotic behavior of the chromatic index for hypergraphs (Q805633) (← links)
- Covering pairs by \(q^ 2+q+1\) sets (Q810520) (← links)
- On the maximal number of edges in a uniform hypergraph with one forbidden intersection (Q892713) (← 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)
