Decompositions of Edge-Colored Complete Graphs and Combinatorial DesignsAlgebra & Discrete Mathematics
|Speaker:||Esther Lamken, CalTech|
|Start time:||Thu, Nov 7 2002, 12:10PM|
In this talk, I will describe an asymptotic existence theorem for decompositions of edge-colored complete graphs into prespecified edge-colored subgraphs. Many problems in combinatorial design theory fall within this framework. Our main theorem can be used to provide several new asymptotic existence results for designs as well as new proofs for the asymptotic existence of several other types of designs. If time permits , I will describe new applications and results for designs with mutually orthogonal resolutions.