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
    • Conference Papers
    • Talks
  • Hiring
    • The IBS Discrete Mathematics Group (DIMAG) Research Fellowship (Due: Dec. 3, 2023)
    • 2022 Call for IBS Young Scientist Fellowship (Due: July 8, 2022)
  • About

Home » News » seminar » Lars Jaffke presented his work on the b-chromatic number of graphs at the Discrete Math Seminar

Posted on May 20, 2019May 21, 2019 by DIMAG

Lars Jaffke presented his work on the b-chromatic number of graphs at the Discrete Math Seminar

On May 20, 2019, Lars Jaffke from University of Bergen, Norway presented his work on algorithmic questions regarding the b-chromatic number of graphs at the Discrete Math Seminar. The title of his talk was “A complexity dichotomy for critical values of the b-chromatic number of graphs“.

Categoriesseminar TagsLarsJaffke

Post navigation

Previous PostPrevious Xin Zhang presented many results on equitable tree-k-colorings of graphs at the discrete math seminar
Next PostNext How to subscribe to the seminar schedule on your phone or the Google Calendar

Upcoming visitors

  • Tue
    20
    Jun
    2023
    Thu
    20
    Jun
    2024

    Chuandong Xu (徐川东)

    Xidian University
  • Wed
    20
    Dec
    2023
    Fri
    22
    Dec
    2023

    Jorn van der Pol

    University of Twente
  • Tue
    09
    Jan
    2024
    Sat
    13
    Jan
    2024

    Jinyoung Park (박진영)

    NYU

Recent Posts

  • Ben Lund gave a talk on the existence of an embedding of every almost spanning tree with specified distances of edges into a finite vector space at the Discrete Math Seminar
  • Hyunwoo Lee (이현우) gave a talk on the existence of a Steiner triple system in a 3-uniform hypergraph with large minimum codegree at the Discrete Math Seminar
  • Seunghun Lee (이승훈) gave a talk on the existence of hypergraphs embeddable in ℝ^d with large chromatic number at the Discrete Math Seminar
  • Bruce A. Reed gave a talk on finding every k-vertex tree as a minor in a graph of large minimum degree and large maximum degree at the Discrete Math Seminar
  • “The 3rd East Asia Workshop on Extremal and Structural Graph Theory” was held in Okinawa

Archives

  • December 2023
  • November 2023
  • October 2023
  • September 2023
  • August 2023
  • July 2023
  • June 2023
  • May 2023
  • April 2023
  • March 2023
  • 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.