Atlanta Lecture Series in Combinatorics and Graph Theory XXX (ALS 30)


Nov 15-16, 2025

Mathematics and Computer Science building,

Emory University, Atlanta, GA 30322


Emory University, Georgia Tech and Georgia State University, with support from the National Science Foundation will continue the series of mini-conferences. The next and 30th overall of these mini-conferences will be held at Emory University on Nov 15-16, 2025. The conference will stress a variety of areas and feature one prominent researcher giving two one hour lectures and other outstanding researchers each giving one 50-minute lecture. There will also be 30 minute lectures by junior reseachers or graduate students. All the talks on Saturday and Sunday morning will be held in Room E208 in the MSC Building, while the talks on Sunday afternoon will be held in W201, across from MSC 208.

Featured Speaker
 
  • Oliver Janzer, EPFL  
  • 50-minute speakers
     

    Half-hour speakers
     

    Graduate student speakers
     



    Conference Schedule

    Saturday
    9:009:30 Registration
    9:3010:20 Sam Spiro Generalized Turán Problems for Trees and More
    10:2010:50 Coffee Break
    10:5011:20 Maya Sankar Abelian Groups with 3-Chromatic Cayley Graphs
    11:2511:55 Eion Mulrenin Color avoidance for monotone paths
    12:0012:30 Ayush Basu Regularity method for cluster hypergraphs
    12:301:45 -------Lunch break-------
    1:452:45 Oliver Janzer An improved upper bound for the multicolour Ramsey number of odd cycles
    2:453:35 Tao Jiang Balanced supersaturation and its applications to enumeration problems
    3:354:05 Coffee Break
    4:054:35 Bryce Frederickson Rainbow paths in regular graphs
    4:405:10 Ruben Ascoli Polynomial-to-Exponential Transition in Hypergraph Ramsey Numbers
    5:155:45 Jiaxi Nie Maximum in-general-position set in a random subset of $\mathbb{F}_q^d$
    Sunday
    9:3010:20 Shira Zerbib  Using the KKM theorem
    10:2010:50 Coffee Break
    10:5011:20 Tianchi Yang Extremal Hypergraphs without Generalized 4-Cycles
    11:2511:55 Alireza Fiujlaali Characterizing Graphs Achieving an Upper Bound on Chromatic Index Involving Girth
    12:0012:30 Tara Abrishami Local and global structure of graphs
    12:301:45 -------Lunch break-------
    1:452:45 Oliver Janzer Nearly tight bounds for MaxCut in hypergraphs
    2:453:35 Anton Bernshteyn Sunflowers, thresholds, and VC-dimension
    3:354:05 Coffee Break
    4:054:55 Sasha Polyanskii The rearrangement inequality meets Tverberg


    Coffee, refreshments, and snacks will be provided during the breaks.



    Registration

    The registration is now open. Please use the following link to register.


    Practical Information
    Direction Housing Parking Dining


    Organizers

    Guantao Chen, Georgia State University
    Liana Yepremyan, Emory University
    Xingxing Yu, Georgia Tech

    Please contact Liana Yepremyan at lyeprem@emory.edu if you have any questions regarding this conference.


    Sponsors

    The organizers gratefully acknowledge NSF for their support of this conference.

    nsf