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 3 of 3 for “"Turan problem"”.
-
Extremal problems in disjoint cycles and graph saturation
… certain subgraph is a computationally difficult problem; as such, sufficient conditions for the existence of a given subgraph are prized. In Chapter 2, we offer a significant refinement of the Corradi-Hajnal Theorem, which gives sufficient conditions for the existence of a given number of …
-
Product Structure, Separating Systems, Freeze-Tag Problem, and Planar Multicolor Turan Number
… The third paper tackles the geometric freeze-tag problem, an optimization problem where the goal is to minimize the total wake-up time for a swarm of robots starting with a single active robot. The authors prove a conjecture by Bonichon et al. regarding an upper bound on the wake-up time for …
-
Problems in extremal graph theory
We consider a variety of problems in extremal graph and set theory. The {\em chromatic number} of $G$, $\chi(G)$, is the smallest integer $k$ such that $G$ is $k$-colorable. The {\it square} of $G$, written $G^2$, is the supergraph of $G$ in which also vertices within distance 2 of each other in …