seminar Archives - Page 29 of 29 - Discrete Mathematics Group

May 16, 2019May 17, 2019

Xin Zhang presented many results on equitable tree-k-colorings of graphs at the discrete math seminar

On May 16, 2019, Xin Zhang (张欣) from Xidian University, China discusses various results on the equitable tree-k-coloring of graphs, a problem of partitioning the vertex set of a graph into vertex-disjoint induced subgraphs having no cycles with almost same size. The title of his talk was “On equitable tree-colorings of graphs”. Xin Zhang is visiting IBS Discrete Mathematics Group from May 15 to May 19.

May 9, 2019May 9, 2019

Sang June Lee presented his work on strong Sidon sets at the Discrete Math Seminar

Sang June Lee (이상준) from Duksung Women’s University presented his recent work on the strong Sidon sets at the Discrete Math Seminar on May 8, 2019. The title of his talk was “On strong Sidon sets of integers”.

April 26, 2019May 16, 2019

Rose McCarty presented her work on the chromatic number of circle graphs at the Discrete Math Seminar

Rose McCarty from University of Waterloo presented her recent breakthrough on the polynomially 𝜒-boundedness of circle graphs at the Discrete Math Seminar on April 26, 2019 . The title of her talk was “circle graphs are polynomially chi-bounded.”

April 19, 2019April 21, 2019

Jon-Lark Kim gave an introductory talk on Boolean functions with Artificial Neural Network

Jon-Lark Kim (김종락) from Sogang University presented a talk at Discrete Math Seminar on April 18, 2019. The title of his talk was “Introduction to Boolean functions with Artificial Neural Network”.

March 12, 2019May 16, 2019

Andreas Holmsen presented his work on an extremal problem on hypergraphs on March 12 at the discrete math seminar

Andreas Holmsen from KAIST gave a talk at Discrete Math Seminar on March 12, 2019 under the title “large cliques in hypergraphs with forbidden substructures.” His work extended a result of extremal graph theory due to Gyárfás, Hubenko, and Solymosi, answering a question of Erdős to hypergraphs and has interesting consequences in topological combinatorics and abstract convexity.

January 28, 2019May 16, 2019

Seog-Jin Kim presented his work on signed colouring and list colouring of k-chromatic graphs on January 28

Seog-Jin Kim from Konkuk University presented a talk at Discrete Math Seminar on January 28, 2019. The title of his talk was “Signed colouring and list colouring of k-chromatic graphs.”

January 4, 2019May 16, 2019

Eun Jung Kim gave a talk on her recent work on the parametrized complexity on January 4

Eun Jung Kim (김은정) from LAMSADE, CNRS, Paris gave a talk at Discrete Math Seminar on January 4, 2019. The title of her talk was “New algorithm for multiway cut guided by strong min-max duality”.

January 3, 2019May 16, 2019

Joonkyung Lee presented his work on Sidorenko’s conjecture on January 3

Joonkyung Lee (이준경) from University of Hamburg gave a talk at Discrete Math Seminar on January 3, 2019. The title of his talk was “Sidorenko’s conjecture for blow-ups”. (This was the first talk at the room B232.)

December 13, 2018May 16, 2019

Hong Liu gave the second discrete math seminar talk at IBS DIMAG

Hong Liu from University of Warwick, UK gave the discrete math seminar talk at DIMAG on his recent work “polynomial Schur’s theorem” on December 13, 2018.

December 10, 2018May 16, 2019

The first seminar talk at DIMAG was given by Tony Huynh on December 10

Tony Huynh from Université libre de Bruxelles became the first person to give a talk at discrete math seminar at DIMAG on December 10, 2018. He talked about his recent work “A tight Erdős-Pósa function for planar minors” (SODA’19).

Category: seminar