KALAMAZOO, Mich.—Western Michigan University's international reputation on the topic of graph theory is on display in a new book published recently by Princeton University Press. "The Fascinating ...

Refining with colors Mathematicians have developed various strategies to compare graphs. Since the 1970s, algorithms have been able to test graph isomorphism, but in exponential time.

New research shows that metasurfaces could be used as strong linear quantum optical networks. The approach could eliminate the need for waveguides and other conventional optical components.

Long monochromatic paths in random graphs presented by Andrzej Dudek, Ph.D., Department of Mathematics, Western Michigan University Abstract: Recall that the size-Ramsey number of F, r^ (F, r), is the ...

The largest components of the critical Erdős-Rényi graph, G (n, p) with p = 1/n, have size of order n⅔ with high probability. We give detailed asymptotics for the probability that there is an ...

Graph theory isn’t enough. The mathematical language for talking about connections, which usually depends on networks—vertices (dots) and edges (lines connecting them)—has been an invaluable ...

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.

Graph theory isn’t enough. The mathematical language for talking about connections, which usually depends on networks — vertices (dots) and edges (lines connecting them) — has been an invaluable way ...