The following pages link to (Q5734432):
Displaying 30 items.
- Nearly-perfect hypergraph packing is in NC (Q286955) (← links)
- On a covering problem in the hypercube (Q489361) (← links)
- Asymptotic behavior of the chromatic index for hypergraphs (Q805633) (← links)
- Covering pairs by \(q^ 2+q+1\) sets (Q810520) (← links)
- Percentages in pairwise balanced designs (Q908919) (← links)
- Lower bounds for coverings of pairs by large blocks (Q910408) (← links)
- Problems related to a de Bruijn-Erdös theorem (Q943846) (← links)
- On a packing and covering problem (Q1058516) (← links)
- Probabilistic methods (Q1091406) (← links)
- Near perfect coverings in graphs and hypergraphs (Q1092067) (← links)
- Families of finite sets in which no set is covered by the union of two others (Q1166519) (← links)
- Minimal covering and maximal packing of (k-1)-subsets by k-subsets (Q1257021) (← 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)
- Asymptotic estimates on the von Neumann inequality for homogeneous polynomials (Q1789365) (← links)
- Matchings and covers in hypergraphs (Q1813100) (← links)
- Ramsey numbers of path-matchings, covering designs, and 1-cores (Q2221922) (← links)
- The domination number of the graph defined by two levels of the \(n\)-cube. II (Q2225404) (← links)
- On subsets of the hypercube with prescribed Hamming distances (Q2299612) (← links)
- On the covering of pairs by quadruples. I (Q2554338) (← links)
- On a generalization of Ramsey numbers (Q2556333) (← links)
- On the size of partial block designs with large blocks (Q2581419) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- A note on the Erdős-Hajnal hypergraph Ramsey problem (Q5086917) (← links)
- The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹 (Q5889065) (← links)
- On the Erd\H{o}s-P\'osa property for immersions and topological minors in tournaments (Q6045407) (← links)
- A proof of the Erdős-Faber-Lovász conjecture (Q6093285) (← links)
- New bounds on the size of nearly perfect matchings in almost regular hypergraphs (Q6139785) (← links)
- Packing cliques in 3‐uniform hypergraphs (Q6187456) (← links)
