Induction over DAGs

142 Views Asked by At

I'd like to prove a proposition true over all valid Directed Acausal Graphs. I think I can do that by starting with a graph with one node and adding either a new node and connection, or a new valid connection. This seems like it would require it's own proof, though - can someone corroborate my intuition, or else show that the proof is trivial?