A következő (extra) kombinatorika szeminárium ideje
<CENTER>
    !!! június 19. (szerda), 10:45 !!!
</CENTER>
helye
<CENTER>
    Kalmár-Intézet, Árpád-tér, első emeleti 53-tanácskozó
                               !!! szemben az eddigiekkel !!!
</CENTER>
és előadása:

<P><CENTER>
Cory Palmer (University of Illinois): 
<B>On the tree packing conjecture</B>
</CENTER>

<P>
Abstract: A set of graphs is said to pack into the complete graph, 
K<SUB>n</SUB>, if
the graphs can be found as edge-disjoint subgraphs of K<SUB>n</SUB>. 
The Gyárfás
tree packing conjecture states that any set of <I>n-1</I> trees 
T<SUB>n</SUB>, T<SUB>n-1</SUB>, ..., T<SUB>2</SUB>
such that
T<SUB>i</SUB> has <I>i</I> vertices pack into K<SUB>n</SUB>.  Even when
we weaken the statement to claim that the largest t > 3 
trees 
T<SUB>n</SUB>, T<SUB>n-1</SUB>, ... ,T<SUB>n-t+1</SUB>
the conjecture remains open. Among others we will discuss
our recent result that any 
t=(1/10)n<SUP>1/4</SUP>
trees 
T<SUB>n</SUB>, T<SUB>n-1</SUB>, ... , T<SUB>n-t+1</SUB>
pack into K<SUB>n+1</SUB> (for n large
enough). (Joint work with J. Balogh.)

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

<P>
Péter

<P><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