Dániel T. Nagy

Incomparable Copies of a Poset in the Boolean Lattice

Let ℬn

Union-Intersecting Set Systems

\mathcal {B}_{n}

Forbidden subposet problems with size restrictions

be the poset generated by the subsets of [n] with the inclusion relation and let P

The method of double chains for largest families with excluded subposets

\mathcal {P}

Rainbow Ramsey problems for the Boolean lattice

be a finite poset. We want to embed P

On the maximum number of copies of H in graphs with given size and order.

\mathcal {P}

On the number of containments in

into ℬn

P

\mathcal {B}_{n}

-free families.

as many times as possible such that the subsets in different copies are incomparable. The maximum number of such embeddings is asymptotically determined for all finite posets P

Stability results on vertex Tur\'an problems in Kneser graphs

\mathcal {P}