Reconstructibility of the $K_r$-count from $n-1$ cards
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2021
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866911779763781632 |
|---|---|
| author | Knierim, Charlotte Martinsson, Anders |
| author_facet | Knierim, Charlotte Martinsson, Anders |
| contents | The Reconstruction Conjecture of Kelly and Ulam states that any graph $G$ with $n\geq 3$ vertices can be reconstructed from the multiset $\mathcal{D}(G)$ of unlabelled subgraphs $G-v$ for all $v\in V(G)$. We refer to $\mathcal{D}(G)$ as the \emph{deck} of $G$ and $G-v\in \mathcal{D}(G)$ as the cards of $G$. This was posed in the 1940s and is still wide open today. In an effort to understand reconstructibility better, a growing collection of research is concerned with understanding what properties of $G$ can be reconstructed from a (potentially adversarially chosen) collection of $k$ cards for some $k< n$. In this paper, we show that the clique count of $G$ is reconstructible for all but one size of clique from any $n-1$ cards. We extend this result by showing that for graphs with average degree at most $3n/8-O(1)$ we can reconstruct the $K_r$-count for all $r$, and that for $r\le \log_2 n$ we can reconstruct the $K_r$-count for every graph on $n$ vertices. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2112_03366 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | Reconstructibility of the $K_r$-count from $n-1$ cards Knierim, Charlotte Martinsson, Anders Combinatorics The Reconstruction Conjecture of Kelly and Ulam states that any graph $G$ with $n\geq 3$ vertices can be reconstructed from the multiset $\mathcal{D}(G)$ of unlabelled subgraphs $G-v$ for all $v\in V(G)$. We refer to $\mathcal{D}(G)$ as the \emph{deck} of $G$ and $G-v\in \mathcal{D}(G)$ as the cards of $G$. This was posed in the 1940s and is still wide open today. In an effort to understand reconstructibility better, a growing collection of research is concerned with understanding what properties of $G$ can be reconstructed from a (potentially adversarially chosen) collection of $k$ cards for some $k< n$. In this paper, we show that the clique count of $G$ is reconstructible for all but one size of clique from any $n-1$ cards. We extend this result by showing that for graphs with average degree at most $3n/8-O(1)$ we can reconstruct the $K_r$-count for all $r$, and that for $r\le \log_2 n$ we can reconstruct the $K_r$-count for every graph on $n$ vertices. |
| title | Reconstructibility of the $K_r$-count from $n-1$ cards |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2112.03366 |