seminar Archives - Page 4 of 36 - Discrete Mathematics Group

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

March 18, 2025March 18, 2025

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

March 11, 2025March 11, 2025

Johannes Carmesin gave a talk at the Discrete Math Seminar on open problems related to temporal graphs and connectivity augmentations

On March 11, 2025, Johannes Carmesin from TU Freiberg gave a talk on open problems related to temporal graphs and connectivity augmentations at the Discrete Math Seminar. The title of his talk was “Open problems in graph theory“.

March 4, 2025March 4, 2025

Irene Muzi gave a talk on obtaining a better bound for the Erdős-Pósa property of directed cycles at the Discrete Math Seminar

On March 4, 2025, Irene Muzi from the University of Hamburg gave a talk at the Discrete Math Seminar on obtaining a better bound for the Erdős-Pósa property of directed cycles. The title of her talk was “An elementary bound for Younger’s conjecture“.

February 26, 2025February 26, 2025

Sepehr Hajebi gave a talk on unavoidable induced subgraphs of graphs of large path-width at the Discrete Math Seminar

On February 25, 2025, Sepehr Hajebi from the University of Waterloo gave a talk at the Discrete Math Seminar on unavoidable induced subgraphs of graphs of large path-width. The title of his talk was “The pathwidth theorem for induced subgraphs“.

February 18, 2025February 18, 2025

O-joung Kwon (권오정) gave a talk at the Discrete Math Seminar on the Erdős-Pósa property of A-paths in group-labelled graphs

On February 18, 2025, O-joung Kwon (권오정) from Hanyang University gave a talk on the condition for the existence of disjoint A-paths in group-labelled graphs at the Discrete Math Seminar. The title of his talk was “Erdős-Pósa property of A-paths in unoriented group-labelled graphs“.

February 12, 2025February 12, 2025

Jungho Ahn (안정호) gave a talk on the Erdős-Pósa property for the induced packing of cycles at the Discrete Math Seminar

On February 11, 2025, Jungho Ahn (안정호) from KIAS gave a talk on the Erdős-Pósa property for the induced packing of cycles at the Discrete Math Seminar. The title of his talk was “A coarse Erdős-Pósa theorem for constrained cycles“.

February 5, 2025February 5, 2025

Jang Soo Kim gave a talk on the maximum of the minimum number of generators to represent an element in a monoid of functions on a fixed finite set and its connection to the minimum feedback arc set of a tournament at the Discrete Math Seminar

On February 4, 2025, Jang Soo Kim (김장수) from Sungkyunkwan University gave a talk on the maximum of the minimum number of generators to represent an element in a monoid of functions on a fixed finite set and its connection to the minimum feedback arc set of a tournament at the Discrete Math Seminar. The title of his talk was “Longest elements in a semigroup of functions and Slater indices“.

Category: seminar