We present three separate chapters covering distinct results in combinatorics; more specifically, Ramsey theory and probabilistic graph theory. The first two chapters are concerned with proving improved bounds on hypergraph Ramsey numbers. The third determines sharp thresholds for various problems related to whether random graph contains a copy of a given subgraph.
