A következő (extra) kombinatorika szeminárium ideje
<P><CENTER>
    július 8. (hétfő), 10:00,
</CENTER>
helye a szokásossá váló
<P><CENTER>
    Kalmár-Intézet, Árpad tér, szemináriumi szoba (második emeletet, a
    folyosó vége)
</CENTER>
és előadása:

<P><CENTER>
Ryan Martin (Iowa State University):
<B>Multipartite Version of the Alon-Yuster Theorem</B>
</CENTER>

<P>
In this talk, we will discuss a proof of the asymptotic multipartite
version of the Alon-Yuster theorem. That is, if $k\geq 3$ is an
integer, $H$ is a $k$-colorable graph and $\gamma>0$ is fixed, then
for sufficiently large n and for every balanced $k$-partite graph $G$
on $kn$ vertices with each of its corresponding ${k\choose 2}$
bipartite subgraphs having minimum degree at least
$\frac{k-1}{k}n+\gamma n$, the graph $G$ has a subgraph consisting of
$\lfloor kn/|V(H)|\rfloor$ vertex-disjoint copies of $H$. This is
joint work with Jozef Skokan, London School of Economics.

<P>
Minden érdeklődőt szeretettel várunk,

<P>
Péter

<P>
<IMG SRC="Infoblokk2_ESZA_egyes.jpg" height="61">
<IMG SRC="szte_cimer.jpg" height="61">
<IMG SRC="USZT_logo_cmyk.jpg" height="61">
<P>
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