| Department of Mathematical Sciences Colloquium Series |
|
 |
|
 |
|
University of Illinois at Urbana-Champaign
C & O Candidate
3:10 p.m. in Math 103
4:00 p.m. Refreshments in Math Lounge 109
|
 |
|
||||||
|
|
||||||
|
Cory T. Palmer University of Illinois at Urbana-Champaign C & O Candidate |
||||||
| A set of graphs is said to pack into the complete graph, Kn , if the graphs can be found as edge-disjoint subgraphs of Kn. In 1978, Gyarfas conjectured that any set of n-1 trees T1, T2, ..., Tn-1 such that Ti has n-i edges packs into Kn. Even when we weaken the statement to claim that the largest t trees T1, T2, ..., Tt pack into Kn the conjecture remains open. Among others we will discuss our recent result that any t=(1/10)n¼ trees T1, T2, ..., Tt such that Ti has n-i edges packs into Kn+1 (for n large enough). (This is joint work with J. Balogh.) | ||||||
|
Thursday, 14 March 2013 3:10 p.m. in Math 103 4:00 p.m. Refreshments in Math Lounge 109 |
||||||
|
||||||
|
||||||