ThmDex – An index of mathematical definitions, results, and conjectures.
Formulation F439 on D2747: Acyclic graph
F439
Formulation 0
Let $G$ be a D778: Graph such that
(i) $\text{Cycles}(G)$ is a D2744: Set of cycle subgraphs for $G$
Then $G$ is an acyclic graph if and only if \begin{equation} \text{Cycles}(G) = \emptyset \end{equation}