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

Graphs that are well connected despite being sparse — having only a small number of edges — are known as expander graphs. These are important in many areas of math, physics and computer science, but ...

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

In 2019, to the delight of the math world, Verstraete and Mubayi used pseudorandom graphs to solve r(3,t). However, Verstraete struggled to build a pseudorandom graph that could help solve r(4,t).

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?