Extremal graph theory

In extremal graph theory, we study the way that different graphs can be connected. A graph is like a map of streets and nodes (places). In extremal graph theory, we want to connect the most possible nodes with the fewest possible streets. We might want to do this so that it takes the least amount of time to get from one node to another.