Dániel T. Nagy
Eötvös Loránd University
Order | 2015
Gyula O. H. Katona; Dániel T. Nagy
Let ℬn
Graphs and Combinatorics | 2015
Gyula O. H. Katona; Dániel T. Nagy
\mathcal {B}_{n}
Journal of Combinatorial Theory | 2018
Dániel T. Nagy
be the poset generated by the subsets of [n] with the inclusion relation and let P
arXiv: Combinatorics | 2013
Péter Burcsi; Dániel T. Nagy
\mathcal {P}
arXiv: Combinatorics | 2018
Fei-Huang Chang; Dániel Gerbner; Wei-Tian Li; Abhishek Methuku; Dániel T. Nagy; Balázs Patkós; Máté Vizer
be a finite poset. We want to embed P
arXiv: Combinatorics | 2018
Dániel Gerbner; Dániel T. Nagy; Balázs Patkós; Máté Vizer
\mathcal {P}
arXiv: Combinatorics | 2018
Dániel Gerbner; Abhishek Methuku; Dániel T. Nagy; Balázs Patkós; Máté Vizer
into ℬn
arXiv: Combinatorics | 2018
Dániel Gerbner; Abhishek Methuku; Dániel T. Nagy; Balázs Patkós; Máté Vizer
\mathcal {B}_{n}
Archive | 2018
Dániel Gerbner; Abhishek Methuku; Dániel T. Nagy; Balázs Patkós; Máté Vizer
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
Archive | 2017
Dániel Gerbner; Abhishek Methuku; Dániel T. Nagy; Balázs Patkós; Máté Vizer
\mathcal {P}
