A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
On intersecting hypergraphs
1998
Discrete Mathematics
We investigate the following question: 'Given an intersecting multi-hypergraph on n points, what fraction of edges must be covered by any of the best 2 points?' (Here 'best' means that together they cover the most.) We call this M2(n). This is a special case of a question asked by Erdfs and Gyhrfils (1990) (they considered r-wise intersecting and the best t points), and is a generalization of work by Mills (1979) who considered the best single point. These are very hard to calculate in general;
doi:10.1016/s0012-365x(97)00136-2
fatcat:segaq44abjb65mzojpn4xgafda