scientific article
From MaRDI portal
Publication:3889076
zbMath0445.05041MaRDI QIDQ3889076
No author found.
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (24)
What we know and what we do not know about Turán numbers ⋮ Uncoverings-by-bases for base-transitive permutation groups. ⋮ Coverings of pairs by quintuples ⋮ Precise values of Turan numbers ⋮ Coverings pairs by quintuples: The case v congruent to 3 (mod 4) ⋮ Edge coloring complete uniform hypergraphs with many components ⋮ On intersecting hypergraphs ⋮ Pair covering designs with block size 5 ⋮ Discrepancies of spanning trees and Hamilton cycles ⋮ The family of t-designs. Part I ⋮ Lower bounds for coverings of pairs by large blocks ⋮ Ramsey numbers of path-matchings, covering designs, and 1-cores ⋮ How to find small AI-systems for antiblocking decoding ⋮ On the covering of \(t\)-sets with \((t+1)\)-sets: \(C(9,5,4)\) and \(C(10,6,5)\) ⋮ Singular points in pair covers and their relation to Hadamard designs ⋮ Dense graphs have \(K_{3,t}\) minors ⋮ Matchings and covers in hypergraphs ⋮ Generalized covering designs and clique coverings ⋮ Optimal partial clique edge covering guided by potential energy minimization ⋮ A method of constructing coverings ⋮ On some covering designs ⋮ Covering pairs by \(q^ 2+q+1\) sets ⋮ Covering triples by quadruples: an asymptotic solution ⋮ Intersecting designs from linear programming and graphs of diameter two
This page was built for publication:
