2 problems

Let $F$ be a star forest with ${n+1\choose 2}$ edges, and suppose that every connected component of $F$ has size at least $n$. An ascending subgraph decomposition (ASD) is an edge…

Let $G$ be a graph with ${n+1\choose 2}$ edges. An ascending subgraph decomposition (ASD) is an edge decomposition … such that $H_i$ has $i$ edges and is isomorphic to a subgraph o…