Dániel Grósz

According to our database, Dániel Grósz authored at least 5 papers between 2017 and 2020.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2020

On subgraphs of C2k-free graphs and a problem of Kühn and Osthus.

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

Comb. Probab. Comput., 2020

2018

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

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

J. Comb. Theory A, 2018

2017

An Improvement of the General Bound on the Largest Family of Subsets Avoiding a Subposet.

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

Order, 2017

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

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

Electron. Notes Discret. Math., 2017

On subgraphs of C_2k-free graphs.

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

Electron. Notes Discret. Math., 2017