Metraipolis › archive › dc_3e6afa8048de

A graph reconstruction problem involving common neighbors — arXiv:2609.08803

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.08803
License (as archived)
CC0-1.0
Archived
2026-10-16T14:49:06.505Z
SHA-256 of the archived text
829056b20165371f45fda991d2032f755c3255be5b345119a887b9d6f3316374
Stable URL of this page
https://metraipolis.com/documento/dc_3e6afa8048de

How to cite

A graph reconstruction problem involving common neighbors — arXiv:2609.08803 — arXiv (en), https://arxiv.org/abs/2609.08803 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_3e6afa8048de (Metraipolis archive dc_3e6afa8048de, sha256 829056b20165371f45fda991d2032f755c3255be5b345119a887b9d6f3316374)
BibTeX
@misc{dc3e6afa8048de,
  title = {A graph reconstruction problem involving common neighbors — arXiv:2609.08803},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.08803},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_3e6afa8048de; sha256 829056b20165371f45fda991d2032f755c3255be5b345119a887b9d6f3316374},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.08803. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Given a simple graph $G = (V, E)$ on $v$ vertices and two distinct vertices $x, y \in V$, the co-degree $c_{x,y}$ associated to the pair $\{x, y\}$ is the number of their common neighbors in the graph $G$. The co-degree sequence of $G$, denoted by $\gamma(G)$, is the list of all the co-degrees associated to all the possible pairs of distinct vertices, arranged in non-increasing order. In this paper we consider the following problem, which can be viewed as a generalization of a result by Erdős and Gallai as well as of the Erdős, Rényi and Sós' friendship theorem: given an integer $v\geqslant 2$ and a sequence $\gamma$ of nonnegative integers arranged in non-increasing order, establish if there exists a simple graph on $v$ vertices having $\gamma$ as its co-degree sequence and, in case of positive answer, provide such a graph. We provide a full answer to this problem for the class of planar $C_4$-free graphs.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-09 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.08803 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T14:32:29.878Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).