April 2025 - Discrete Mathematics Group

April 15, 2025April 15, 2025

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“.

April 14, 2025April 14, 2025

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“.

April 9, 2025April 9, 2025

Marcelo Garlet Milani gave a talk on the directed grid theorem at the Discrete Math Seminar

On April 8, 2025, Marcelo Garlet Milani from NII, Japan gave a talk at the Discrete Math Seminar on an alternative proof of the directed grid theorem. The title of his talk was “Cycles of Well-Linked Sets and an Elementary Bound for the Directed Grid Theorem“.

April 1, 2025April 1, 2025

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“.

Month: April 2025

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

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

Marcelo Garlet Milani gave a talk on the directed grid theorem at the Discrete Math Seminar

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

Marcin Briański

Daniel McGinnis

Pascal Schweitzer