A note on the edge-reconstruction of K₁,m-free graphs

DOI10.1016/0095-8956(90)90033-VMaRDI QIDQ1102982zbMATH OpenOpenAlexFDO

Authors Ilia Krasikov

Publication date 1990

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0095-8956(90)90033-v

zbMATH Keywords

edge reconstruction conjecturek(1,m)-free graphsstar free graphs

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

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.

Recommendations

• scientific article; zbMATH DE number 3948324
• scientific article; zbMATH DE number 4162923
• scientific article; zbMATH DE number 68355
• Reconstructing graphs from their k-edge deleted subgraphs
• scientific article; zbMATH DE number 125494

Cites work

• scientific article; zbMATH DE number 3165195 (Why is no real title available?)
• scientific article; zbMATH DE number 3904630 (Why is no real title available?)
• scientific article; zbMATH DE number 3948324 (Why is no real title available?)
• scientific article; zbMATH DE number 3674136 (Why is no real title available?)
• On the reconstruction of a graph from its closure function
• The edge reconstruction hypothesis is true for graphs with more than n log n edges
• The edge reconstruction of hamiltonian graphs

Cited in

(7)

• Reconstructing graphs from their k-edge deleted subgraphs
• Claw-free graphs---a survey
• Dense graphs and edge reconstructions
• scientific article; zbMATH DE number 4162923 (Why is no real title available?)
• scientific article; zbMATH DE number 3948324 (Why is no real title available?)
• scientific article; zbMATH DE number 68355 (Why is no real title available?)
• A survey on edge reconstruction of graphs

This page was built for publication: A note on the edge-reconstruction of \(K_{1,m}\)-free graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1102982)