No label defined (Q3976607)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 19179
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 19179 |
Statements
26 June 1992
0 references
arboricity
0 references
random graph
0 references
edge-disjoint spanning trees
0 references
0.8436090350151062
0 references
[For the entire collectin see Zbl 0734.00014.] If \(G\) is the random graph, then the authors show that the expression \(| E(H)|/(| V(H)|-1)\) in the formula for arboricity given by \(a(G)=\max_{H\subseteq G}\left\lceil{| E(H)|\over | V(H)|-1}\right\rceil\) attains its maximum if and only if \(H=G\). They also obtain the maximum number of edge-disjoint spanning trees in the random graph \(G\). For the entire collection see [Zbl 0751.05025].
0 references
