Reconstructing the degree sequence of a sparse graph from a partial deck (Q2171022)
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 7590554
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Reconstructing the degree sequence of a sparse graph from a partial deck |
scientific article; zbMATH DE number 7590554 |
Statements
Reconstructing the degree sequence of a sparse graph from a partial deck (English)
0 references
23 September 2022
0 references
graph reconstruction
0 references
degree sequence
0 references
\(K_t\)-counts
0 references
partial deck
0 references
missing cards
0 references
reconstruction conjecture
0 references
0 references
0.8640020489692688
0 references
0.8628073930740356
0 references
0.8319843411445618
0 references
0.8169652223587036
0 references
0.808838963508606
0 references
