Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2309.10113

Graph Reconstruction from Connected Triples

Yaxin Qi
View original source ↗Read source document ↗Export metadata ↓

Abstract

The problem of graph reconstruction has been studied in its various forms over the years. In particular, the Reconstruction Conjecture, proposed by Ulam and Kelly in 1942, has attracted much research attention and yet remains one of the foremost unsolved problems in graph theory. Recently, Bastide, Cook, Erickson, Groenland, Kreveld, Mannens, and Vermeulen proposed a new model of partial information, where we are given the set of connected triples T_3, which is the set of 3-subsets of the vertex set that induce connected subgraphs. They proved that reconstruction is unique within the class of triangle-free graphs, 2-connected outerplanar graphs, and maximal planar graphs. They also showed that almost every graph can be uniquely reconstructed from their connected triples. However, little is known about other classes of non-triangle-free graphs within which reconstruction can occur uniquely, nor do we understand what kind of graphs can be uniquely reconstructed from their connected triples without assuming anything about the classes of graphs to which they belong. The main result of this paper is a complete characterization of all graphs that can be uniquely reconstructed from their connected triples T_3. We also show that reconstruction from T_3 is unique within the class of regular planar graphs, 5-connected planar graphs, certain strongly regular graphs, and complete multi-partite graphs, whereas it is not unique for the class of k-connected planar graphs with k less or equal to 4, Eulerian graphs, or Hamiltonian graphs.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yaxin Qi. 2023-09-18. Graph Reconstruction from Connected Triples. https://arxiv.org/abs/2309.10113

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗