Embedding Factorizations for 3-Uniform Hypergraphs (Q4920661): Difference between revisions

@@ Property / Wikidata QID @@
+Q114236179
@@ Property / Wikidata QID: Q114236179 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.05949
@@ Property / arXiv ID: 1710.05949 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4135587
@@ Property / cites work: Q4135587 / rank @@
+Normal rank
@@ Property / cites work @@
+A proof of Lindner's conjecture on embeddings of partial Steiner triple systems
+Normal rank
@@ Property / cites work @@
+Embeddings of Steiner triple systems
@@ Property / cites work: Embeddings of Steiner triple systems / rank @@
+Normal rank
@@ Property / cites work @@
+An existence theorem for latin squares
@@ Property / cites work: An existence theorem for latin squares / rank @@
+Normal rank
@@ Property / cites work @@
+Hamiltonian decompositions of complete graphs
@@ Property / cites work: Hamiltonian decompositions of complete graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Amalgamations of connected \(k\)-factorizations.
@@ Property / cites work: Amalgamations of connected \(k\)-factorizations. / rank @@
+Normal rank
@@ Property / cites work @@
+Hamiltonian decompositions of complete regular s-partite graphs
+Normal rank
@@ Property / cites work @@
+Amalgamations of factorizations of complete graphs
+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 @@
+Amalgamations of almost regular edge-colourings of simple graphs
+Normal rank
@@ Property / cites work @@
+Embedding edge‐colorings into 2‐edge‐connected <i>k</i>‐factorizations of <i>k<sub>kn+1</sub></i>
+Normal rank
@@ Property / cites work @@
+A Combinatorial Theorem with an Application to Latin Rectangles
+Normal rank