Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 1 of 1 for “"minimal saturated graphs"”.
-
Problems in extremal combinatorics
… -union-free})$. A graph $G$ is {\it $F$-saturated } if it does not contain $F$ as a subgraph but the addition of any new edge creates at least one copy of $F$ in $G$. We focus on finding the minimum size of an $n$-vertex $F$-saturated graph, denoted by $\sat(n,F)$. We prove $ \sat(n,C_k) …