On the expected number of edges in a maximum matching of an (r,s)-tree (Q4876339): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The Enumeration of Point Labelled Chromatic Graphs and Trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Asymptotic Methods in Enumeration / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5616724 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Matchings in random superpositions of bipartite trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Matchings in superpositions of (<i>n, n</i>)‐bipartite trees / rank | |||
Normal rank | |||
Latest revision as of 11:54, 24 May 2024
scientific article; zbMATH DE number 872729
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the expected number of edges in a maximum matching of an (r,s)-tree |
scientific article; zbMATH DE number 872729 |
Statements
On the expected number of edges in a maximum matching of an (r,s)-tree (English)
0 references
1 May 1996
0 references
matchings
0 references
exponential generating functions
0 references
