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
.
Critical hypergraphs and intersecting set-pair systems
1985
Journal of combinatorial theory. Series B (Print)
A method is given for solving extremal problems of the following type: determine the maximal number of vertices in a class of hypergraphs. Results are applied for T-critical and v-critical hypergraphs. 0 1985 Academic Press, Inc. (i) Ai"Bj=(2/ if and only if i=j whenever 1 <ii, j<m. An ISP-system is called (a, @-system if, additionally, (ii) [Ai/ = a and IBil = b for every i < m. The heart of our method is Lemma 4 which says that a suitable (a, b)system can be gained from the hypergraph if a
doi:10.1016/0095-8956(85)90043-7
fatcat:5q3iozxw25agdcpgzvf4nshblm