Uniform generation of \(d\)-factors in dense host graphs (Q2014710): Difference between revisions

@@ Property / DOI @@
-.1007/s00373-013-1284-1
@@ Property / DOI: 10.1007/s00373-013-1284-1 / rank @@
-Normal rank
@@ Property / cites work @@
+A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
+Normal rank
@@ Property / cites work @@
+The asymptotic number of labeled graphs with given degree sequences
+Normal rank
@@ Property / cites work @@
+Exponentially many perfect matchings in cubic graphs
+Normal rank
@@ Property / cites work @@
+Approximating the Permanent
@@ Property / cites work: Approximating the Permanent / rank @@
+Normal rank
@@ Property / cites work @@
+Q3096705
@@ Property / cites work: Q3096705 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3684147
@@ Property / cites work: Q3684147 / rank @@
+Normal rank
@@ Property / cites work @@
+Uniform generation of random regular graphs of moderate degree
+Normal rank
@@ Property / cites work @@
+Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\)
+Normal rank
@@ Property / cites work @@
+Asymptotic enumeration by degree sequence of graphs of high degree
+Normal rank
@@ Property / DOI @@
+.1007/S00373-013-1284-1
@@ Property / DOI: 10.1007/S00373-013-1284-1 / rank @@
+Normal rank