Mathias Schacht

On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree

We study sufficient

Regular Partitions of Hypergraphs: Regularity Lemmas

\ell

Extremal results for random discrete structures

-degree (

Dirac-type results for loose Hamilton cycles in uniform hypergraphs

1\leq\ell<k

Generalizations of the removal lemma

) conditions for the appearance of perfect and nearly perfect matchings in

WEAK QUASI-RANDOMNESS FOR UNIFORM HYPERGRAPHS

k

Weak hypergraph regularity and linear hypergraphs

-uniform hypergraphs. In particular, we obtain a minimum vertex degree condition (

Regular Partitions of Hypergraphs: Counting Lemmas

\ell=1

On the KŁR conjecture in random graphs

) for 3-uniform hypergraphs, which is approximately tight, by showing that every 3-uniform hypergraph on

Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions

n