Bât. Braconnier, salle Fokko du Cloux (ICJ, Université Lyon 1)
Bât. Braconnier, salle Fokko du Cloux
ICJ, Université Lyon 1
Description
For a given pair of two graphs (F,H), let R(F,H) be the smallest
positive integer r such that for any graph G of order r, either G
contains F as a subgraph or the complement of G contains H as a
subgraph. Baskoro, Broersma and Surahmat (2005) conjectured that
R(F_l,K_n)=2l(n-1)+1 for l≧n≧3, where F_l is the join of K_1 and lK_
2. In this talk, we prove that this conjecture is true for the case
n=6. This is a joint work with Shin-ya Kadota (Nagoya Univ.) and
Tomokazu Onozuka (Toyota Tech. Inst.).
Joint work with Shin-ya Kadota and Tomokazu Onozuka.
