Search arXivSearch

arXiv · 2311.13492

Every atom-atom map can be explained by electron pushing diagrams

Abstract

Chemical reactions can be understood as transformations of multigraphs (molecules) that preserve vertex labels (atoms) and degrees (sums of bonding and non-bonding electrons), thereby implying the atom-atom map of a reaction. The corresponding reaction mechanism is often described by an electron pushing diagram that explains the transformation by consecutive local relocations of invidudal edges (electron pairs). Here, we show that every degree-preserving map between multigraphs, and thus every atom-atom map, can be generated by cyclic electron pushing. Moreover, it is always possible to decompose such an explanation into electron pushing diagrams involving only four electron pairs. This in turn implies that every reaction can be decomposed into a sequence of elementary reactions that involve at most two educt molecules and two product molecules. Hence, the requirement of a mechanistic explantion in terms of electron pushing and small imaginary transition states does not impose a combinatorial constraint on the feasibility of hypothetical chemical reactions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Christoph Flamm, Stefan Müller, Peter F. Stadler. 2023-11-22. Every atom-atom map can be explained by electron pushing diagrams. https://arxiv.org/abs/2311.13492

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

KEEP EXPLORING

Related papers

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

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