On June 27, 2023, Chong Shangguan (上官冲) from Shandong University gave a talk at the Discrete Math Seminar on the maximum number of colors of hats so that at least one of the players can correctly guess his or her hat color while only seeing the colors of their neighbors on a graph. The title of his talk was “the hat guessing number of graphs.”
Guanghui Wang gave a talk on the maximum number of edges in uniformly dense hypergraphs with a forbidden subgraph at the Discrete Math Seminar
On June 20, 2023, Guanghui Wang (王光辉) from Shandong University gave a talk at the Discrete Math Seminar on the maximum number of edges in uniformly dense hypergraphs with a forbidden subgraph. The title of his talk was “Embeddings in uniformly dense hypergraphs.”
Minho Cho gave a talk on the maximum size of a pure pair in graph classes at the Discrete Math Seminar
On June 13, 2023, Minho Cho (조민호) from the IBS Extremal Combinatorics and Probability Group gave a talk at the Discrete Math Seminar on determining the maximum size of a pure pair in graph classes regarding the strong Erdős-Hajnal property. The title of his talk was “Strong Erdős-Hajnal property on chordal graphs and its variants.”
Suyun Jiang (江素云) gave a talk on the maximum number of edges in a connected graph without a fixed tree at the Discrete Math Seminar
On May 30, 2023, Suyun Jiang (江素云) from Jianghan University gave a talk on the maximum number of edges in a connected graph without a fixed tree at the Discrete Math Seminar. She is currently a visiting scholar at the IBS Extremal Combinatorics and Probability Group. The title of her talk was “How connectivity affects the extremal number of trees.”
Szymon Toruńczyk gave an online talk, introducing the flip-width of graphs at the Virtual Discrete Math Colloquium
On May 17, 2023, Szymon Toruńczyk from the University of Warsaw gave an online talk at the Virtual Discrete Math Colloquium, introducing the flip-width of graphs at the Virtual Discrete Math Colloquium. The title of his talk was “Flip-width: Cops and Robber on dense graphs.”
Oliver Janzer gave a talk on finding a subgraph of large average degree on a small vertex set at the Discrete Math Seminar
On May 16, 2023, Oliver Janzer from the University of Cambridge gave a talk at the Discrete Math Seminar on finding a subgraph of large average degree on a small vertex set at the Discrete Math Seminar. The title of his talk was “small subgraphs with large average degree.”
Maria Chudnovsky gave a colloquium talk on bounding the tree-width by forbidding induced subgraphs
On May 11, 2023, Maria Chudnovsky from Princeton University gave a colloquium talk held at KAIST about bounding the tree-width of graphs by forbidding induced subgraphs. The titlte of her talk was “Induced subgraphs and tree decompositions.”
Jozef Skokan gave a talk on finding a collection of paths such that for every pair e, f of edges, the collection has a path having e but not f at the Discrete Math Seminar
On May 9, 2023, Jozef Skokan from LSE gave a talk at the Discrete Math Seminar on finding a collection of linearly many paths such that for every pair e, f of distinct edges, there is a path having e but not f in the collection. The title of his talk was “Separating the edges of a graph by a linear number of paths.”
Rob Morris gave a talk showing the sketch of the proof that the diagonal Ramsey number is less than (4-𝜀)^k at the Discrete Math Seminar
During the Discrete Math Seminar held on May 2, 2023, Rob Morris of IMPA presented on the recent breakthrough regarding the diagonal Ramsey number, specifically demonstrating that $R(k,k)<(4-\varepsilon)^k$. The title of his talk was “An exponential improvement for diagonal Ramsey.”
Rob Morris gave a colloquium talk at KAIST on Ramsey Theory
On April 27, 2023, Rob Morris from IMPA gave a colloquium talk on Ramsey Theory at the Colloquium of KAIST Mathematical Sciences. The title of his talk was “Ramsey theory: searching for order in chaos.” Rob Morris is currently visiting IBS and will give a seminar talk at IBS on May 2 with more details on his latest theorem on diagonal Ramsey numbers.











