The following pages link to (Q3889076):
Displaying 24 items.
- Edge coloring complete uniform hypergraphs with many components (Q598467) (← links)
- How to find small AI-systems for antiblocking decoding (Q658118) (← links)
- Dense graphs have \(K_{3,t}\) minors (Q709308) (← links)
- Covering pairs by \(q^ 2+q+1\) sets (Q810520) (← links)
- Uncoverings-by-bases for base-transitive permutation groups. (Q851785) (← links)
- Pair covering designs with block size 5 (Q879393) (← links)
- Lower bounds for coverings of pairs by large blocks (Q910408) (← links)
- A method of constructing coverings (Q1057870) (← links)
- On some covering designs (Q1065807) (← links)
- Covering triples by quadruples: an asymptotic solution (Q1072560) (← links)
- Coverings of pairs by quintuples (Q1106231) (← links)
- Precise values of Turan numbers (Q1110509) (← links)
- Coverings pairs by quintuples: The case v congruent to 3 (mod 4) (Q1116950) (← links)
- The family of t-designs. Part I (Q1146481) (← links)
- On the covering of \(t\)-sets with \((t+1)\)-sets: \(C(9,5,4)\) and \(C(10,6,5)\) (Q1182924) (← links)
- Singular points in pair covers and their relation to Hadamard designs (Q1182942) (← links)
- Intersecting designs from linear programming and graphs of diameter two (Q1322228) (← links)
- On intersecting hypergraphs (Q1379831) (← links)
- Matchings and covers in hypergraphs (Q1813100) (← links)
- What we know and what we do not know about Turán numbers (Q1895823) (← links)
- Ramsey numbers of path-matchings, covering designs, and 1-cores (Q2221922) (← links)
- Optimal partial clique edge covering guided by potential energy minimization (Q2329666) (← links)
- Discrepancies of spanning trees and Hamilton cycles (Q2668020) (← links)
- Generalized covering designs and clique coverings (Q3100732) (← links)
