scientific article; zbMATH DE number 3695222
From MaRDI portal
Publication:3889076
Cited in
(27)- A method of constructing coverings
- On some covering designs
- Covering triples by quadruples: an asymptotic solution
- Coverings of pairs by quintuples
- Precise values of Turan numbers
- Coverings pairs by quintuples: The case v congruent to 3 (mod 4)
- The family of t-designs. Part I
- 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
- Intersecting designs from linear programming and graphs of diameter two
- On intersecting hypergraphs
- Matchings and covers in hypergraphs
- What we know and what we do not know about Turán numbers
- Ramsey numbers of path-matchings, covering designs, and 1-cores
- Optimal partial clique edge covering guided by potential energy minimization
- Discrepancies of spanning trees and Hamilton cycles
- Generalized covering designs and clique coverings
- Edge coloring complete uniform hypergraphs with many components
- New lower bounds for \(t\)-coverings
- How to find small AI-systems for antiblocking decoding
- Bounds on data limits for all-to-all comparison from combinatorial designs
- The power of many colours
- Dense graphs have \(K_{3,t}\) minors
- Covering pairs by q^ 2+q+1 sets
- Uncoverings-by-bases for base-transitive permutation groups.
- Pair covering designs with block size 5
- Lower bounds for coverings of pairs by large blocks
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3889076)
