Skip to content
Discrete Mathematics Group

Discrete Mathematics Group

기초과학연구원 이산수학그룹

  • Home
  • People
    • Members
    • Visitors
    • Former Members
  • News
  • Events
    • Seminars and Colloquiums
      • Discrete Math Seminar
      • Virtual Discrete Math Colloquium
      • Colloquium
    • Workshops and Conferences
    • Research Program
    • Videos
  • Visiting
  • Research
    • Papers
    • Talks
  • Hiring
    • The IBS Discrete Mathematics Group (DIMAG) Postdoctoral Research Fellowship (Due: December 5, 2021)
    • 2022 Call for IBS Young Scientist Fellowship (Due: July 8, 2022)
  • About

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

Posted on June 2, 2020June 25, 2022 by DIMAG

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

Categoriesseminar TagsHuy-TungNguyen

Post navigation

Previous PostPrevious Hong Liu gave a talk describing approximate structures of an n-vertex m-edge graph minimizing the number of cliques of size k at the Discrete Math Seminar
Next PostNext Jiseung Kim (김지승) talked about the hardness and concrete security in cryptography at the Discrete Math Seminar

Upcoming visitors

  • Sat
    04
    Feb
    2023
    Sat
    18
    Feb
    2023

    Raphael Steiner

    ETH Zürich
  • Thu
    16
    Feb
    2023
    Sun
    26
    Feb
    2023

    Meike Hatzel

    National Institute of Informatics, Japan
  • Tue
    07
    Mar
    2023

    Eunjin Oh (오은진)

    Dept. of Computer Science and Engineering, POSTECH

Recent Posts

  • Benjamin Bergougnoux gave an online talk on proving tight lower bounds for the running time of various problems parameterized by rank-width at the Virtual Discrete Math Colloquium
  • Abhishek Methuku gave a talk on the resolution of the Erdős-Faber-Lovász conjecture at the Discrete Math Seminar
  • Pedro Montealegre gave an online talk on a proof labeling scheme certifying that the graph has tree-width at most k and satisfies a monadic second-order property with certificates of small size at each vertex at the Virtual Discrete Math Colloquium
  • Noleen Köhler gave a talk on classes of graphs on which the parameterized complexity of the FO model checking on their subclasses can be explained by the twin-width at the Discrete Math Seminar
  • Mamadou Moustapha Kanté gave a talk on the recognizability and the MSO definability of a class of matroids having the strongly pigeonhole property at the Discrete Math Seminar

Archives

  • February 2023
  • January 2023
  • December 2022
  • November 2022
  • October 2022
  • September 2022
  • August 2022
  • July 2022
  • June 2022
  • May 2022
  • April 2022
  • March 2022
  • February 2022
  • January 2022
  • December 2021
  • November 2021
  • October 2021
  • September 2021
  • August 2021
  • July 2021
  • June 2021
  • May 2021
  • April 2021
  • March 2021
  • February 2021
  • January 2021
  • December 2020
  • November 2020
  • October 2020
  • September 2020
  • August 2020
  • July 2020
  • June 2020
  • May 2020
  • April 2020
  • March 2020
  • February 2020
  • January 2020
  • December 2019
  • November 2019
  • October 2019
  • September 2019
  • August 2019
  • July 2019
  • June 2019
  • May 2019
  • April 2019
  • March 2019
  • February 2019
  • January 2019
  • December 2018

Categories

  • conference
  • news
  • seminar
  • workshop
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.