Subscribe to Events

We discuss two stories of simple questions leading to interesting connections. The first concerns the minimum number of states a deterministic finite automaton needs to distinguish between two given strings. The second concerns the maximum number of triangles in an n-vertex graph with maximum degree d. No background assumed.