On the expected number of edges in a maximum matching of an (r,s)-tree (Q4876339): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1080/00207169508804386
+Normal rank
@@ Property / OpenAlex ID @@
+W2015572657
@@ Property / OpenAlex ID: W2015572657 / rank @@
+Normal rank
@@ Property / cites work @@
+The Enumeration of Point Labelled Chromatic Graphs and Trees
+Normal rank
@@ Property / cites work @@
+Asymptotic Methods in Enumeration
@@ Property / cites work: Asymptotic Methods in Enumeration / rank @@
+Normal rank
@@ Property / cites work @@
+Q5616724
@@ Property / cites work: Q5616724 / rank @@
+Normal rank
@@ Property / cites work @@
+Matchings in random superpositions of bipartite trees
+Normal rank
@@ Property / cites work @@
+Matchings in superpositions of (<i>n, n</i>)‐bipartite trees
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:4876339