The existence of \(k\)-radius sequences (Q645973): Difference between revisions

@@ Property / DOI @@
-.1016/j.jcta.2011.08.004
@@ Property / DOI: 10.1016/j.jcta.2011.08.004 / rank @@
-Normal rank
@@ Property / cites work @@
+Q3503433
@@ Property / cites work: Q3503433 / rank @@
+Normal rank
@@ Property / cites work @@
+Constructing 𝑘-radius sequences
@@ Property / cites work: Constructing 𝑘-radius sequences / rank @@
+Normal rank
@@ Property / cites work @@
+Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences
+Normal rank
@@ Property / cites work @@
+Universal cycles for combinatorial structures
@@ Property / cites work: Universal cycles for combinatorial structures / rank @@
+Normal rank
@@ Property / cites work @@
+Near-Universal Cycles for Subsets Exist
@@ Property / cites work: Near-Universal Cycles for Subsets Exist / rank @@
+Normal rank
@@ Property / cites work @@
+Near perfect coverings in graphs and hypergraphs
@@ Property / cites work: Near perfect coverings in graphs and hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Matchings and covers in hypergraphs
@@ Property / cites work: Matchings and covers in hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Consecutive storage of relevant records with redundancy
+Normal rank
@@ Property / cites work @@
+On Universal Cycles for <i>k</i>-Subsets of an <i>n</i>-Set
+Normal rank
@@ Property / cites work @@
+Universal cycles of \(k\)-subsets and \(k\)-permutations
+Normal rank
@@ Property / cites work @@
+Sequences of Radius k: How to Fetch Many Huge Objects into Small Memory for Pairwise Computations
+Normal rank
@@ Property / cites work @@
+Constructions of asymptotically shortest \(k\)-radius sequences
+Normal rank
@@ Property / cites work @@
+Q3335022
@@ Property / cites work: Q3335022 / rank @@
+Normal rank
@@ Property / cites work @@
+Asymptotic behavior of the chromatic index for hypergraphs
+Normal rank
@@ Property / cites work @@
+On a packing and covering problem
@@ Property / cites work: On a packing and covering problem / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.JCTA.2011.08.004
@@ Property / DOI: 10.1016/J.JCTA.2011.08.004 / rank @@
+Normal rank