In mathematics and computer science, a directed acyclic graph, is a finite directed graph with no directed cycles. It consists of finitely many vertices and edges, with each edge directed from one ...

Imagine 100 dots scattered in front of you. In a haphazard variation on connect-the-dots, start drawing lines between the points. How many lines can you draw without producing a triangle? A square? An ...