A következő kombinatorika szeminárium ideje
helye
és előadása:
This lecture will be based on the still unpublished paper of Josef Cibulka, Pu Gao, Marek Krcal, Tomas Valla and Pavel Valtr of the same title. The geometric/convex Ramsey number of a planar graph $G$ is the smallest number n which has the property of every 2-edge colored geometric/convex Kn containing a monocromatic noncrossing copy of G. They proved polynomial upper bounds for the geometrix and convex Ramsey numbers of the ladder graph L2n, then generalized their method for 2-pathwidth graphs. The lecture will be about these results.
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