scientific article; zbMATH DE number 3198027
From MaRDI portal
Publication:5734432
zbMath0122.24802MaRDI QIDQ5734432
Publication date: 1964
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
On Additive Bases and Harmonious Graphs ⋮ The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹 ⋮ Nearly-perfect hypergraph packing is in NC ⋮ Probabilistic methods ⋮ Near perfect coverings in graphs and hypergraphs ⋮ On the difference between asymptotically good packings and coverings ⋮ Fractional v. integral covers in hypergraphs of bounded edge size ⋮ Nearly perfect matchings in regular simple hypergraphs ⋮ A note on the Erdős-Hajnal hypergraph Ramsey problem ⋮ On the Erd\H{o}s-P\'osa property for immersions and topological minors in tournaments ⋮ A proof of the Erdős-Faber-Lovász conjecture ⋮ New bounds on the size of nearly perfect matchings in almost regular hypergraphs ⋮ Packing cliques in 3‐uniform hypergraphs ⋮ Percentages in pairwise balanced designs ⋮ Lower bounds for coverings of pairs by large blocks ⋮ On Tight Cycles in Hypergraphs ⋮ Families of finite sets in which no set is covered by the union of two others ⋮ Ramsey numbers of path-matchings, covering designs, and 1-cores ⋮ The domination number of the graph defined by two levels of the \(n\)-cube. II ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ On a covering problem in the hypercube ⋮ Problems related to a de Bruijn-Erdös theorem ⋮ Asymptotic estimates on the von Neumann inequality for homogeneous polynomials ⋮ Minimal covering and maximal packing of (k-1)-subsets by k-subsets ⋮ On subsets of the hypercube with prescribed Hamming distances ⋮ Matchings and covers in hypergraphs ⋮ A natural barrier in random greedy hypergraph matching ⋮ On the covering of pairs by quadruples. I ⋮ On a generalization of Ramsey numbers ⋮ On a packing and covering problem ⋮ On the size of partial block designs with large blocks ⋮ Asymptotic behavior of the chromatic index for hypergraphs ⋮ Extremal problems for convex geometric hypergraphs and ordered hypergraphs ⋮ Covering pairs by \(q^ 2+q+1\) sets
