A note on the edge-reconstruction of \(K_{1,m}\)-free graphs (Q1102982)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A note on the edge-reconstruction of \(K_{1,m}\)-free graphs |
scientific article; zbMATH DE number 4051673
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on the edge-reconstruction of \(K_{1,m}\)-free graphs |
scientific article; zbMATH DE number 4051673 |
Statements
A note on the edge-reconstruction of \(K_{1,m}\)-free graphs (English)
0 references
1990
0 references
It is shown that there exist absolute constants \(c_ 1\), \(c_ 2\) such that any \(K_{1,m}\)-free graph with maximum degree \(\Delta >c_ 1m(\log _ 2m)^{1/2}\) or graph with average degree \(d>2 \log _ 2m+\log _ 2\log _ 2m+c_ 2\) is edge reconstructible.
0 references
edge reconstruction conjecture
0 references
k(1,m)-free graphs
0 references
star free graphs
0 references
