Completing small partial triple systems (Q1053018): Difference between revisions

@@ Property / cites work @@
+Embedding Partial Steiner Triple Systems
@@ Property / cites work: Embedding Partial Steiner Triple Systems / rank @@
+Normal rank
@@ Property / cites work @@
+Every generalized Petersen graph has a Tait coloring
+Normal rank
@@ Property / cites work @@
+Embedding partial Steiner triple systems is NP-complete
+Normal rank
@@ Property / cites work @@
+On Cyclic Steiner 2-Designs
@@ Property / cites work: On Cyclic Steiner 2-Designs / rank @@
+Normal rank
@@ Property / cites work @@
+A partial Steiner triple system of order n can be embedded in a Steiner triple system of order 6n + 3
+Normal rank
@@ Property / cites work @@
+Q5525397
@@ Property / cites work: Q5525397 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximal consistent families of triples
@@ Property / cites work: Maximal consistent families of triples / rank @@
+Normal rank
@@ Property / cites work @@
+The completion of finite incomplete Steiner triple systems with applications to loop theory
+Normal rank