On the Existence of Loose Cycle Tilings and Rainbow Cycles
abstract: Extremal graph theory results often provide minimum degree conditions which guarantee a copy of one graph exists within another. A perfect $F$-tiling of a graph $G$ is a collection $\mathcal{F}$ of subgraphs of $G$ such that every element of $\mathcal{F}$ is isomorphic to $F$ and such...
| Other Authors: | |
|---|---|
| Format: | Doctoral Thesis |
| Language: | English |
| Published: |
2019
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/2286/R.I.53704 |