Combinatorics in the news Undergraduate Math Student Pushes Frontier of Graph Theory At 21, Ashwin Sah has produced a body of work that senior mathematicians say is nearly unprecedented for a college student. "The May proof focused on an important feature of combinatorics called Ramsey numbers, which quantify how big a graph (a collection of dots, or vertices, connected by edges) can get before it necessarily contains a certain kind of substructure. ... Sah’s proof, in contrast, improved the upper bound for two-color Ramsey numbers. He achieved it by optimizing a method that originated with Erdős and Szekeres, and which a small number of mathematicians have managed to improve since. Sah’s result proves that once a graph reaches a certain size, it inevitably contains a clique of some corresponding size. Many in the field see Sah’s proof

Combinatoricists in the news From the article: Noga Alon and Joel Spencer receive 2021 Steele Prize for Mathematical Exposition December 01, 2020 The 2021 Steele Prize for Mathematical Exposition will be awarded to  Noga Alon  and  Joel Spencer  for their book,  The Probabilistic Method , published by Wiley & Sons Inc. in 1992. Now in its fourth edition,  The Probabilistic Method  is an invaluable toolbox for both the beginner and the experienced researcher in discrete probability. It brings together through one unifying perspective a variety of results and methods, linked to applications in graph theory, combinatorics, number theory, and geometry. This enduring book has been used worldwide. Much-cited by significant papers in leading journals, it functions as both on-ramp and toolbox.  The Probabilistic Method  has its roots in the work of Paul Erdős, and this volume brings together a dizzying array

Announcement of virtual conference

  WELCOME to the 52nd Southeastern International Conference on Combinatorics, Graph Theory and Computing, March 8-12, 2021      Welcome to the  52 nd  meeting of the Southeastern International Conference on Combinatorics, Graph Theory and Computing March 8-12, 2021 (virtual) Hello Everyone! Holiday greetings from the 52 nd   Southeastern International Conference on Combinatorics, Graph Theory and Computing!  While much has changed for us all during the pandemic, we are happy to officially announce that we will  meet virtually  on a platform developed by  Whova .  All talks will be live!    Registration is Open!   REGISTER HERE!   Once you have registered, a link to the Whova platform will be sent to you.  Please make your plans and register early!  The scheduling of your talk in tentative until you have registered for the SEICCGTC 52.   The abstract submission deadline is Monday, February 9, 2021.   Thank you so much for your continued support of the  Southeastern International Confere