기초과학연구원 이산수학그룹
On April 11, 2022, Younjin Kim (김연진) from POSTECH gave a talk at the Discrete Math Seminar on the number of k-dimensional corner-free subsets of the k-dimensional grid {1,2,…n}^k. The title of her talk was “On the extremal problems related to Szemerédi’s theorem“.
To celebrate the opening of the IBS Extremal Combinatorics and Probability Group, the IBS ECOPRO Opening Conference was held online from April 4 to April 6. There were 10 invited speakers and more than 100 participants.
Jeong Han Kim, 7:15-8:00pm
Majority dynamics on sparse random graphs
Oleg Pikhurko, 8:00-8:45pm
Moser-Tardos Algorithm with small number of random bits
Jeff Kahn, 8:45-9:30pm
Linear cover time is exponentially unlikely
Noga Alon, 9:30-10:15pm
Random processes of graphs and permutations
Mihyun Kang, 8:00-8:45pm
Random subgraphs of the hypercube
József Balogh, 8:45-9:30pm
On Robustness of The Erdős-Ko-Rado Theorem
Benny Sudakov, 9:30-10:15pm
Short proofs of rainbow matching results
Van Vu, 8:00-8:45pm/1:00-1:45pm/7:00-7:45am
Majority dynamics on a random graph: The power of few
Tibor Szabó, 8:45-9:30pm
Topology at the North Pole
Nati Linial, 9:30-10:15pm
Geodesic Geometry of Graphs
On April 1, 2022, Hong Liu from the University of Warwick is appointed as the Chief Investigator to lead a new group, the IBS Extremal Combinatorics and Probability Group (ECOPRO), in the Center for Mathematical and Computational Sciences. To enhance our collaboration, the IBS Discrete Mathematics Group will move to the 3rd floor of the theory building on April 19-21 to share the space with the Extremal Combinatorics and Probability Group.
On March 30, 2022, Jean-Florent Raymond from LIMOS, CNRS, France gave an online talk at the Virtual Discrete Math Colloquium on the maximum length of an induced path in a graph having a long path when the graph has bounded path-width, tree-width, or excludes a fixed topological minor. The title of his talk was “Long induced paths in minor-closed graph classes and beyond“.
On March 28, 2022, Ben Lund from the IBS Discrete Mathematics Group gave a talk at the Discrete Math Seminar on the threshold function for a random subset of a finite vector space to have certain intersection properties with all m-dimensional affine subspaces at the Discrete Math Seminar. The title of his talk was “Thresholds for incidence properties in finite vector spaces“.
The MATRIX-IBS Workshop “Structural Graph Theory Downunder II” was held from March 20 to March 27 at Creswick, Victoria, Australia. This program is supported by MATRIX and the Discrete Mathematics Group (DIMAG) of the Institute for Basic Science (IBS, Korea). MATRIX is a residential research institute for the mathematical sciences in Australia.
On March 21, 2022, Jaehoon Kim (김재훈) from KAIST gave a talk at the Discrete Math Seminar on the Ramsey number with respect to a cycle graph and an arbitrary graph. The title of his talk was “Ramsey numbers of cycles versus general graphs“.
On March 14, 2022, Tuan Anh Do (Tuấn Anh Đỗ) from the Graz University of Technology / IBS Discrete Mathematics Group gave a talk at the Discrete Math Seminar on rank-width and tree-width of graphs of supercritical random graphs at the Discrete Math Seminar. The title of his talk was “Rank- and tree-width of supercritical random graphs“.
The IBS Discrete Mathematics Group welcomes Tuan Anh Do (Tuấn Anh Đỗ), a visiting graduate student from the Graz University of Technology in Austria. He is a graduate student of Prof. Mihyun Kang and is planning to stay with us until the end of August 2022.
On March 10, 2022, Fedor Fomin from the University of Bergen gave an online talk at the Virtual Discrete Math Colloquium on the parameterized complexity of determining whether a 2-connected graph has a cycle of length at least k plus the bound given by the Dirac’s theorem or the Erdős-Gallai theorem. The title of his talk was “Long cycles in graphs: Extremal Combinatorics meets Parameterized Algorithms“.