Show that every strict acyclic digraph contains an arc whose reversal results in an acyclic digraph. [closed]

try using topological sorting i.e, try to name the vertices from 1 to n in an order in which any node with a larger number has no directed edge to a node with a smaller number for example node 1 can have an edge to node 3 but node 3 can't have an edge to node 1. this is the topological representation of an acyclic graph.

then note that for a graph to be strictly acyclic every node with a smaller number has to be connected to any node with a larger number for example 2 should have a directed edge to 3, 4, 5, ..., n. because we know that 2 is connected to 3 and 3 is connected to 4 so 2 also has to be connected to 4 and you can generalize this up to n.

now in the stated topological representation of strict acyclic digraph, consider changing the direction of the directed edge between node 1 and 2 to a directed edge from 2 to 1 and keeping all other edges as before, this way by reversing a directed edge you still get an acyclic digraph but not a strict one.

hope it was helpful.

How to prove that $E(M_n 1_{F})=E(M_r 1_{F})$ for a discrete-time martingale $M_n$ with $r>n$?

What does it mean to be in the same probability space?

Well Ordering implies Induction Proof doubt

$\lim_{n \to \infty}\frac{1}{n}\sum_{k = 1}^nf(k)$ where $f(n)$ is the largest prime factor exponent?

Is this enough to be differentiable?

Wrong answers to simple trigonometry questions

Composite of decreasing and increasing function [closed]

Use the Lagrange multiplier method to find the maximum possible volume for a rectangular box inscribed in the ellipsoid $2x^2 + 3y^2+4z^2=12$

Essential support vs. classical support for a continuous function

Convolution of tempered distribution with $C_c^\infty$ function is $C_c^\infty$

Recommendations on how to tie a bunch of Get- to an output .txt