Calendar

Posted August 18, 2025

Discussion and Training in Combinatorics

Gyaneshwar Agrahari, LSU
Emmanuel Astante, Louisiana State University
Organizational Meeting of DTC Seminar

The first meeting of the Discussion and Combinatorics Seminar will be held on this day and time. In this meeting, we will introduce everyone and give the details of how the seminar will be run.

Posted September 1, 2025

Discussion and Training in Combinatorics

Week 2: Review of Topology

This week, our speaker, Sayani Mukherjee, will kick off our discussion on the applications of the Borsuk-Ulam Theorem. Ms. Mukherjee is a second-year PhD student in our department. She will review the first two sections of the textbook: "Using the Borsuk-Ulam Theorem: Lectures on Topological Methods in Combinatorics and Geometry"

Posted February 3, 2026

Discussion and Training in Combinatorics

Joy Harris
Ramsey Number of Daisies

Given the set of vertices $[n]=\{1,\ldots,n\}$, an \emph{$r$-daisy}, given by disjoint sets $K,M \subset [n]$, is the $(r+|K|)$-uniform hypergraph defined as \[ \{K \cup P : P \subset M \text{ and } |P|=r\}. \] In this talk, we will discuss the \emph{Ramsey number of daisies}. This is the minimum number of vertices $n$ such that no coloring of the subsets of $[n]$ by $\ell$ colors yields a monochromatic daisy. We will give a probabilistic proof showing a lower bound for this number.

Event contact: Gyaneshwar Agrahari and Emmanuel Asante