A threshold for perfect matchings in random d-pure hypergraphs (Q1839262): Difference between revisions

@@ Property / author @@
+Jeanette P. Schmidt
@@ Property / author: Jeanette P. Schmidt / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Fast probabilistic algorithms for Hamiltonian circuits and matchings
+Normal rank
@@ Property / cites work @@
+Q4198785
@@ Property / cites work: Q4198785 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4773670
@@ Property / cites work: Q4773670 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4065548
@@ Property / cites work: Q4065548 / rank @@
+Normal rank
@@ Property / cites work @@
+On the combinatorial problems which I would most like to see solved
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+One-factor in random graphs based on vertex choice
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0012-365x(83)90044-4
+Normal rank
@@ Property / OpenAlex ID @@
+W1963909248
@@ Property / OpenAlex ID: W1963909248 / rank @@
+Normal rank