Loading Events

Upcoming Events › Discrete Math Seminar

Events Search and Views Navigation

Event Views Navigation

April 2019


Rose McCarty, Circle graphs are polynomially chi-bounded

April 26 Friday @ 4:00 PM - 5:00 PM
Room B232, IBS (기초과학연구원)

Circle graphs are the intersection graphs of chords on a circle; vertices correspond to chords, and two vertices are adjacent if their chords intersect. We prove that every circle graph with clique number k has chromatic number at most $4k^2$. Joint with James Davies.

Find out more »

May 2019


Sang June Lee (이상준), On strong Sidon sets of integers

May 8 Wednesday @ 4:30 PM - 5:30 PM
Room B232, IBS (기초과학연구원)

Let $\mathbb N$ be the set of natural numbers. A set $A\subset \mathbb N$ is called a Sidon set if the sums $a_1+a_2$, with $a_1,a_2\in S$ and $a_1\leq a_2$, are distinct, or equivalently, if \ for every $x,y,z,w\in S$ with $x<y\leq z<w$. We define strong Sidon sets as follows: For a constant $\alpha$ with $0\leq \alpha<1$, a set $S\subset \mathbb N$ is called an $\alpha$-strong Sidon set if \ for every $x,y,z,w\in S$ with $x<y\leq z<w$. The motivation of strong Sidon…

Find out more »

Xin Zhang, On equitable tree-colorings of graphs

May 16 Thursday @ 4:30 PM - 5:30 PM
Room B232, IBS (기초과학연구원)

An equitable tree-$k$-coloring of a graph is a vertex coloring using $k$ distinct colors such that every color class (i.e, the set of vertices in a common color) induces a forest and the sizes of any two color classes differ by at most one. The minimum integer $k$ such that a graph $G$ is equitably tree-$k$-colorable is the equitable vertex arboricity of $G$, denoted by $va_{eq}(G)$. A graph that is equitably tree-$k$-colorable may admits no equitable tree-$k'$-coloring for some $k'>k$.…

Find out more »

Lars Jaffke, A complexity dichotomy for critical values of the b-chromatic number of graphs


May 24 Friday @ 4:30 PM - 5:30 PM
Room B232, IBS (기초과학연구원)

A $b$-coloring of a graph $G$ is a proper coloring of its vertices such that each color class contains a vertex that has at least one neighbor in all the other color classes. The $b$-Coloring problem asks whether a graph $G$ has a $b$-coloring with $k$ colors. The $b$-chromatic number of a graph $G$, denoted by $\chi_b(G)$, is the maximum number $k$ such that $G$ admits a $b$-coloring with $k$ colors. We consider the complexity of the $b$-Coloring problem, whenever…

Find out more »
+ Export Events
기초과학연구원 수리및계산과학연구단 이산수학그룹
대전 유성구 엑스포로 55 (우) 34126
Discrete Mathematics Group (DIMAG)
Pioneer Research Center for Mathematical and Computational Sciences
Institute for Basic Science (IBS)
55 Expo-ro Yuseong-gu Daejeon 34126 South Korea
E-mail: dimag@ibs.re.kr
Copyright (c) IBS 2018. All rights reserved.