A következő kombinatorika szeminárium ideje

február 21. (péntek), !!!! 10:30 !!!!,

helye

Kalmár Intézet, Árpád tér, szemináriumi szoba (második emelet, a folyosó vége)

és előadása:

Hong Liu (UIUC): Subdivisions of a large clique in C6-free graphs

Joint work with Jozsef Balogh and Maryam Sharifzadeh

Mader conjectured that every C4-free graph has a subdivision of a clique of order linear in its average degree. We show that every C6-free graph has such a subdivision of a large clique.

We also prove the dense case of Mader's conjecture in a stronger sense, i.e.~for every c, there is a c' such that every C4-free graph with average degree cn1/2 has a subdivision of a clique Kl with $\ell=\lfloor c'n1/2\rfloor$ where every edge is subdivided exactly 3 times.

Minden érdeklődőt szeretettel várunk,

Péter

Supported by TÁMOP-4.2.2.A-11/1/KONV-2012-0073, Telemedicine Oriented Research in the Fields of Mathematics, Informatics and Medical Sciences