News

Posted on

Marcin Briański gave a talk at the Discrete Math Seminar on the existence of large Burling graphs or large complete graphs on string graphs of very large chromatic number

On April 22, 2025, Marcin Briański from Jagiellonian University in Krakóv, Poland gave a talk on the existence of large Burling graphs or large complete graphs on string graphs of very large chromatic number at the Discrete Math Seminar. The title of his talk was “Burling Graphs as (almost) universal obstacles to 𝜒-boundedness“.

Posted on

Nicola Lorenz gave a talk on the existence of a normal tree spanning a given set of vertices in an infinite graph in terms of the coloring number of rooted minors at the Discrete Math Seminar

On April 15, 2025, Nicola Lorenz from the University of Hamburg gave a talk on the existence of a normal tree spanning a given set of vertices in an infinite graph in terms of the coloring number of rooted minors at the Discrete Math Seminar. The title of her talk was “A Minor Characterisation of Normally Spanned Sets of Vertices“.

Posted on

Daniel McGinnis gave a talk at the Discrete Math Seminar on determining the existence of a k-dimensional affine subspace intersecting every member of a given finite family of convex sets in the d-dimensional real space

On April 14, 2025, Daniel McGinnis from Princeton University gave a talk on determining the existence of a k-dimensional affine subspace intersecting every member of a given finite family of convex sets in the d-dimensional real space at the Discrete Math Seminar. The title of his talk was “A necessary and sufficient condition for k-transversals“.

Posted on

Hyunwoo Lee (이현우) gave a talk on determining the matching polynomial of k-uniform hypergraphs from the list of all induced subhypergraphs of fixed size at the Discrete Math Seminar

On April 1, 2025, Hyunwoo Lee (이현우) from KAIST and IBS Extremal Combinatorics and Probability Group gave a talk at the Discrete Math Seminar on the problem of determinining the matching polynomial of k-uniform hypergraphs from the list of all induced subhypergraphs of fixed size. The title of his talk was “Reconstructing hypergraph matching polynomials“.

Posted on

Michał T. Seweryn gave a talk on the existence of Kelly’s poset in a poset of sufficient large dimension with a planar cover graph at the Discrete Math Seminar

On March 18, 2025, Michał T. Seweryn from Charles University gave a talk at the Discrete Math Seminar showing that every poset of very large dimension with a planar cover graph has Kelly’s poset of large dimension. The title of his talk was “Dimension and standard examples in planar posets“.

Posted on

Sebastian Wiederrecht gave lectures during the third week of the IBS-DIMAG School on Graph Minors

From February 17 to 19, 2025, the third and last week of the IBS-DIMAG Winter School on Graph minors took place at IBS with lectures by Sebastian Wiederrecht from KAIST. He gave lectures on explaining tangles, sketching the proof of the Graph Minor Structure Theorem of Robertson and Seymour, and presenting the key idea of improving the bounds (for vortices and apices) to polynomials.

This school was held for three consecutive weeks from February 3, 2025.

IBS 이산수학그룹 Discrete Mathematics Group
기초과학연구원 수리및계산과학연구단 이산수학그룹
대전 유성구 엑스포로 55 (우) 34126
IBS Discrete Mathematics Group (DIMAG)
Institute for Basic Science (IBS)
55 Expo-ro Yuseong-gu Daejeon 34126 South Korea
E-mail: dimag@ibs.re.kr, Fax: +82-42-878-9209
Copyright © IBS 2018. All rights reserved.