Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1403.5806

Antiparallel d-stable Traces and a Stronger Version of Ore Problem

Jernej Rus
View original source ↗Read source document ↗Export metadata ↓

Abstract

In $2013$ a novel self-assembly strategy for polypeptide nanostructure design which could lead to significant developments in biotechnology was presented in [Design of a single-chain polypeptide tetrahedron assembled from coiled-coil segments, Nature Chem. Bio. 9 (2013) 362--366]. It was since observed that a polyhedron $P$ can be realized by interlocking pairs of polypeptide chains if its corresponding graph $G(P)$ admits a strong trace. It was since also demonstrated that a similar strategy can also be expanded to self-assembly of designed DNA [Design principles for rapid folding of knotted DNA nanostructures, Nature communications 7 (2016) 1--8.]. In this direction, in the present paper we characterize graphs which admit closed walk which traverses every edge exactly once in each direction and for every vertex $v$, there is no subset $N$ of its neighbors, with $1 \leq |N| \leq d$, such that every time the walk enters $v$ from $N$, it also exits to a vertex in $N$. This extends C. Thomassen's characterization [Bidirectional retracting-free double tracings and upper embeddability of graphs, J. Combin. Theory Ser. B 50 (1990) 198--207] for the case $d = 1$.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jernej Rus. 2016-10-21. Antiparallel d-stable Traces and a Stronger Version of Ore Problem. https://doi.org/10.1007/s00285-016-1077-2

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↗