The edge reconstruction hypothesis is true for graphs with more than n log n edges
From MaRDI portal
Publication:1232426
DOI10.1016/0095-8956(77)90074-0zbMath0344.05161OpenAlexW2040590647MaRDI QIDQ1232426
Publication date: 1977
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(77)90074-0
Related Items (16)
Balance equations for reconstruction problems ⋮ Reconstructing graphs from their k-edge deleted subgraphs ⋮ Finite-type invariants for graphs and graph reconstructions ⋮ Combinatorial reconstruction problems ⋮ A note on the edge-reconstruction of \(K_{1,m}\)-free graphs ⋮ Inclusion-exclusion: exact and approximate ⋮ Reconstruction of k-orbits of a permutation group ⋮ Kernels of modular inclusion maps ⋮ Reconstruction of infinite graphs ⋮ Edge reconstruction of the Ihara zeta function ⋮ The \(k\)-orbit reconstruction and the orbit algebra ⋮ Counterexamples to the Edge Reconstruction Conjecture for infinite graphs ⋮ Rigidity and reconstruction for graphs ⋮ A surprising permanence of old motivations (a not-so-rigid story) ⋮ A reconstruction problem related to balance equations. II: The general case ⋮ Quotients of Peck posets
This page was built for publication: The edge reconstruction hypothesis is true for graphs with more than n log n edges
