June 2020 - Discrete Mathematics Group

June 24, 2020June 24, 2020

Jaehoon Kim (김재훈) gave a talk on a resilience version of Pósa’s theorem regarding Hamiltonian cycles at the Discrete Math Seminar

On June 23, 2020, Jaehoon Kim (김재훈) from KAIST presented his work with Padraig Condon, Alberto Espuny Diaz, Daniela Kühn and Deryk Osthus on a resilience version of Pósa’s theorem regarding a sufficient condition on the degree sequence for a graph to have a Hamiltonian cycle at the Discrete Math Seminar. The title of his talk is “A resilience version of Pósa’s theorem“.

June 16, 2020June 16, 2020

Andreas Holmsen gave a talk on a recent work generalizing the fractional Helly theorem under very weak topological assumptions at the Discrete Math Seminar

On June 16, 2020, Andreas Holmsen from KAIST presented his recent work with Xavier Goaoc and Zuzana Patáková on generalizing the fractional Halley theorem under very weak topological assumptions. The title of his talk was “Fractional Helly and topological complexity“.

June 9, 2020June 9, 2020

Jiseung Kim (김지승) talked about the hardness and concrete security in cryptography at the Discrete Math Seminar

On June 9, 2020, Jiseung Kim (김지승) from KIAS presented a talk on some aspects of cryptography, including his recent work “Adventures in Crypto Dark Matter: Attacks, Fixes, and Analysis of weak PRF” jointly with Jung Hee Cheon, Wonhee Cho, and Jeong Han Kim. The title of his talk was “Hardness and concrete security in cryptography“.

June 2, 2020June 25, 2022

Huy-Tung Nguyen gave a talk on the average cut-rank of a graph at the Discrete Math Seminar

On June 2, 2020, Huy-Tung Nguyen from KAIST gave a talk on the graph parameter called the average cut-rank of a graph. The title of his talk is “The average cut-rank of graphs“.

Month: June 2020

Jaehoon Kim (김재훈) gave a talk on a resilience version of Pósa’s theorem regarding Hamiltonian cycles at the Discrete Math Seminar

Andreas Holmsen gave a talk on a recent work generalizing the fractional Helly theorem under very weak topological assumptions at the Discrete Math Seminar

Jiseung Kim (김지승) talked about the hardness and concrete security in cryptography at the Discrete Math Seminar

Huy-Tung Nguyen gave a talk on the average cut-rank of a graph at the Discrete Math Seminar

Chuandong Xu (徐川东)

Niloufar Fuladi

Magnus Wahlström