On the maximum number of edges in a hypergraph with a unique perfect matching (Q409380): Difference between revisions

@@ Property / DOI @@
-.1016/j.disc.2011.07.016
@@ Property / DOI: 10.1016/j.disc.2011.07.016 / rank @@
-Normal rank
@@ Property / author @@
-Andrzej Dudek
@@ Property / author: Andrzej Dudek / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2030828012
@@ Property / OpenAlex ID: W2030828012 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.3158
@@ Property / arXiv ID: 1104.3158 / rank @@
+Normal rank
@@ Property / cites work @@
+On unique \(k\)-factors and unique \([1,k]\)-factors in graphs.
+Normal rank
@@ Property / cites work @@
+On the structure of factorizable graphs. II
@@ Property / cites work: On the structure of factorizable graphs. II / rank @@
+Normal rank
@@ Property / cites work @@
+Q3395507
@@ Property / cites work: Q3395507 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.DISC.2011.07.016
@@ Property / DOI: 10.1016/J.DISC.2011.07.016 / rank @@
+Normal rank