Discrete math is one of the oldest branches of mathematics, with a direct line of descent from problems studied in the most ancient mathematical texts. It includes number theory, the study of patterns ...

The picture above shows our game represented as a graph — a collection of points (called vertices) and segments between them (called edges). The dilemma you face exemplifies a simple but profound idea ...

Graph theory seems simple on the surface: A bunch of dots, called nodes, connected by lines called edges. It's the study of connecting entities of one sort of another (objects, concepts, or ...

The study of such graphs is called graph theory. Engineers need to find planarity in a graph when, for example, they are designing a computer chip without a crossed wire.

Alternating Connectivity in Random Graphs, Part II presented by Ryan Cushman, Department of Mathematics, Western Michigan University Abstract: This talk will be a continuation of last week's talk. In ...

In this paper, a characterization of Lyapunov graphs associated to smooth flows on surfaces is presented. We first obtain necessary and sufficient conditions for a Lyapunov graph to be associated to ...

Here’s a good, clear post by Mark Chu-Carroll, a software engineer at Google, on graph theory. It describes how Euler used it to solve a conundrum involving bridges in Königsberg. In a previous ...