An asymptotic independence theorem for the number of matchings in graphs (Q1043805): Difference between revisions

@@ Property / DOI @@
-.1007/s00373-008-0832-6
@@ Property / DOI: 10.1007/s00373-008-0832-6 / rank @@
-Normal rank
@@ Property / cites work @@
+Q4402005
@@ Property / cites work: Q4402005 / rank @@
+Normal rank
@@ Property / cites work @@
+The number of matchings in random regular graphs and bipartite graphs
+Normal rank
@@ Property / cites work @@
+A new proof of a theorem of Siegel
@@ Property / cites work: A new proof of a theorem of Siegel / rank @@
+Normal rank
@@ Property / cites work @@
+On the theory of the matching polynomial
@@ Property / cites work: On the theory of the matching polynomial / rank @@
+Normal rank
@@ Property / cites work @@
+Q3807048
@@ Property / cites work: Q3807048 / rank @@
+Normal rank
@@ Property / cites work @@
+Theory of monomer-dimer systems
@@ Property / cites work: Theory of monomer-dimer systems / rank @@
+Normal rank
@@ Property / cites work @@
+On acyclic systems with minimal Hosoya index
@@ Property / cites work: On acyclic systems with minimal Hosoya index / rank @@
+Normal rank
@@ Property / cites work @@
+Q2859380
@@ Property / cites work: Q2859380 / rank @@
+Normal rank
@@ Property / cites work @@
+Enumeration problems for classes of self-similar graphs
+Normal rank
@@ Property / cites work @@
+Q4253909
@@ Property / cites work: Q4253909 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S00373-008-0832-6
@@ Property / DOI: 10.1007/S00373-008-0832-6 / rank @@
+Normal rank