most citedLarge B_d-free and union-free subfamilies

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

collaborators
Showing math.COShow all

2 papers · 1 filter

math.CO2012★ 1 cited

The number of graphs of given diameter

Zoltan Furedi, Younjin Kim

In this paper it is proved that there are constants 0< c_2< c_1 such that an asymptotic formula can be given for the the number of (labeled) n-vertex graphs of diameter d whenever…

math.CO2010★ 1 cited

Large B_d-free and union-free subfamilies

János Barát, Zoltán Füredi, Ida Kantor +2

For a property and a family of sets $\cF$, let $f(\cF,Γ)$ be the size of the largest subfamily of $\cF$ having property . For a positive integer , let be the min…