Reconstructing graphs from their k-edge deleted subgraphs (Q1077434): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claims |
||
| Property / author | |||
| Property / author: Q933676 / rank | |||
| Property / author | |||
| Property / author: Ilia Krasikov / rank | |||
| Property / author | |||
| Property / author: Yehuda Roditty / rank | |||
Revision as of 10:39, 10 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Reconstructing graphs from their k-edge deleted subgraphs |
scientific article |
Statements
Reconstructing graphs from their k-edge deleted subgraphs (English)
0 references
1987
0 references
Let G be a graph with m edges and n vertices. We show that if \(2^{m- k}>n!\) or if \(2m>\left( \begin{matrix} n\\ 2\end{matrix} \right)+k\) then G is determined by its collection of k-edge deleted subgraphs.
0 references
graph reconstruction
0 references
k-edge deleted subgraphs
0 references
