Q4262220 (Q4262220): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A probabilistic proof of an asymptotic formula for the number of labelled regular graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Upsets in Round Robin Tournaments / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A theorem on flows in networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Asymptotic enumeration by degree sequence of graphs of high degree / rank | |||
Normal rank | |||
Latest revision as of 22:29, 28 May 2024
scientific article; zbMATH DE number 1334601
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | No label defined |
scientific article; zbMATH DE number 1334601 |
Statements
11 November 1999
0 references
Markov-chain algorithms
0 references
generating labeled bipartite graphs
0 references
degree sequence
0 references
labeled tournaments
0 references
score sequence
0 references
