For ak k‐vertex graph FF and an nn‐vertex graph GG, an FF‐tiling in GG is a collection of
vertex‐disjoint copies of FF in G G. For r∈ ℕ r ∈ N, the rr‐independence number of GG …

The following question was proposed by Nenadov and Pehova and reiterated by Knierim
and Su: given μ> 0 and integers ℓ, r and n with n∈ r N, is it true that there exists an α> 0 …

Given a graph and an integer, we denote by the maximum size of a-free subset of vertices in.
A recent question of Nenadov and Pehova asks for determining the best possible minimum …

Given two graphs and, an-tiling of is a collection of vertex-disjoint copies of in and an-factor
is an-tiling that covers all vertices of. Kühn and Osthus managed to characterize, up to an …

In this note, we investigate for various pairs of graphs $(H, G) $ the question of how many
random edges must be added to a dense graph to guarantee that any red-blue coloring of …

For a $ k $-vertex graph $ F $ and an $ n $-vertex graph $ G $, an $ F $-tiling in $ G $ is a
collection of vertex-disjoint copies of $ F $ in $ G $. For $ r\in\mathbb {N} $, the $ r …

In this thesis, we make progress on three problems in extremal combinatorics, particularly in
relation to finding large spanning subgraphs, and removing induced subgraphs. First, we …

Clique Factors: Extremal and Probabilistic Perspectives Page 1 Clique Factors: Extremal and
Probabilistic Perspectives w1 w2 w3 w4 Dissertation zur Erlangung des Grades eines Doktors …