Dániel Grósz

activity

20142018

most citedAn improvement of the general bound on the largest family of subsets avoiding a subposet

21 citations · 21 across the 1 of their papers we have counts for

collaborators

3 papers

math.CO2018

Uniformity thresholds for the asymptotic size of extremal Berge- $F$ -free hypergraphs

Dániel Grósz, Abhishek Methuku, Casey Tompkins

Let $F = (U, E)$ be a graph and $H = (V, E)$ be a hypergraph. We say that $H$ contains a Berge- $F$ if there exist injections $ψ : U \to V$ and $φ:E\to \mat…

math.CO2016

An upper bound on the size of diamond-free families of sets

Dániel Grósz, Abhishek Methuku, Casey Tompkins

Let $L a (n, P)$ be the maximum size of a family of subsets of $[n] = {1, 2, ..., n}$ not containing $P$ as a (weak) subposet. The diamond poset, denoted $B_{2}$ , is defined on four elem…

math.CO2014★ 21 cited

An improvement of the general bound on the largest family of subsets avoiding a subposet

Dániel Grósz, Abhishek Methuku, Casey Tompkins

Let $L a (n, P)$ be the maximum size of a family of subsets of $[n] = {1, 2, ..., n}$ not containing $P$ as a (weak) subposet, and let $h (P)$ be the length of a longest chain in $P$ .…

Uniformity thresholds for the asymptotic size of extremal Berge-F-free hypergraphs

An upper bound on the size of diamond-free families of sets

An improvement of the general bound on the largest family of subsets avoiding a subposet

Uniformity thresholds for the asymptotic size of extremal Berge- $F$ -free hypergraphs