A note on the edge-reconstruction of \(K_{1,m}\)-free graphs
type: Item
instance of: scholarly article
title: A note on the edge-reconstruction of \(K_{1,m}\)-free graphs
zbMATH Open document ID: 0645.05051
DOI: 10.1016/0095-8956(90)90033-V
published in: Journal of Combinatorial Theory. Series B
publication date: 1990-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05C60
zbMATH DE Number: 4051673
zbMATH Keywords: edge reconstruction conjecture
zbMATH Keywords: k(1,m)-free graphs
zbMATH Keywords: star free graphs
author: Ilia Krasikov
MaRDI profile type: Publication
cites work: Q3682518
cites work: On the reconstruction of a graph from its closure function
cites work: Q3283482
cites work: Q3718755
cites work: The edge reconstruction hypothesis is true for graphs with more than n log n edges
cites work: Q3870936
cites work: The edge reconstruction of hamiltonian graphs
full work available at URL: 0095-8956(90)90033-v
OpenAlex ID: W1993533260
description: scientific article; zbMATH DE number 4051673