A note on the edge-reconstruction of \(K_{1,m}\)-free graphs
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.
scientific article; zbMATH DE number 4051673
scientific article