Avi Wigderson, an award-winning computer scientist and mathematician, gave a lecture on “randomness” at Stony Brook ...

Back in the hazy olden days of the pre-2000s, navigating between two locations generally required someone to whip out a paper map and painstakingly figure out the most optimal route between those ...

This course is available on the BSc in Mathematics and Economics, BSc in Mathematics with Economics and BSc in Mathematics, Statistics and Business. This course is available as an outside option to ...

Graph polynomials serve as robust algebraic encodings of the intricate combinatorial properties inherent to graphs. At the heart of this discipline lies the Tutte polynomial, an invariant that not ...

This course is available on the MSc in Applicable Mathematics and MSc in Operations Research & Analytics. This course is available as an outside option to students on other programmes where ...

Although lecture is the traditional method of university mathematics instruction, there has been little empirical research that describes the general structure of lectures. In this paper, we adapt ...

An interactive programming package called GRAPH, an expert system for graph theory, was developed at the University of Belgrade, Faculty of Electrical Engineering, during the period 1980-1984, GRAPH ...

THIS is emphatically a text-book, deductive in method and Euclidean in arrangement; as such, it has the defects of its qualities, but its merits are undeniable. In this volume the author deals with ...

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 ...

An old conjecture, probably going back to G. A. Dirac in the 1950's, states that regular graphs of large degree are Class 1 (with respect to edge-colorings): This conjecture has a counterpart where it ...