turkmath.org

Given a collection of graphs $\cal{H}$, an $\cal{H}$-decomposition of a graph $G$ is a decomposition of the edges of $G$ into isomorphic copies of graphs in $\cal{H}$. The copies of $H\in \cal{H}$ in the decomposition are called blocks. Such a decompo- sition is called resolvable if it is possible to partition the blocks into classes $P_i$ such that every point of $G$ appears exactly once in some block of each $P_i$ Moreover a class is called uniform if every block of the class is isomorphic to the same graph from $\cal{H}$. In this talk, we will present famous problems in the area of graph designs and explain recent results on uniformly resolvable $\cal{H}$-decomposition problems.