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

After more than 70 years of intransigence, one of the most stubborn numbers in math has finally budged. In a four-page proof posted in late September, David Conlon and Asaf Ferber provided the most ...

They worked on a range of topics within discrete mathematics like graph theory, probability and the properties of random matrices. Many of the problems they tackled were relatively simple to state and ...

Math students learn about Ramsey problems early on, so r(4,t) ... In 1937, Erdös discovered that using random graphs could give good lower bounds on Ramsey problems.

Evolutionary graph theory has many fascinating applications ranging from ecology to multi-cellular organization ... On the evolution of random graphs. Publ. Math. Inst. Hungarian Acad. Sci. 5, 17 ...

The Clearest Graphs You Will Ever See Refuting the Idea That Women Are Bad at Math By Hanna Rosin Terri Oda is a mathematician who now works in computer science.

In random walks, it has been long known that there are groups that have these memories while in other groups the memories are erased. ... More Math. Can You Solve This Viral Triangle Brain Teaser?

People are math, too. A social graph is a collection of people, companies, institutions, and even concepts (people connecting to pages or sites about genres of music or fashion designers, ...