Helly-type Hypergraphs and Sperner Families

European Journal of Combinatorics - Tập 5 - Trang 185-187 - 1984
Zs. Tuza1
1Computer and Automation Institute, Hungarian Academy of Sciences, H-1111 Budapest, Kende u. 13-17 Hungary

Tài liệu tham khảo

Bollobás, 1965, On generalized graphs, Acta Math. Acad. Sci. Hungar., 16, 447, 10.1007/BF01904851 Bollobás, 1979, Helly families of maximal size, J. Combin. Theory Ser. A., 26, 197, 10.1016/0097-3165(79)90071-2 Jaeger, 1971, Détermination du nombre maximum d'arêtes d'un hypergraphe τ-critique, C.R. Acad. Sci. Paris, 273, 221 Lubell, 1966, A short proof of Sperner's lemma, J. Combin. Theory, 1, 299, 10.1016/S0021-9800(66)80035-2 Sperner, 1928, Ein Satz über Untermengen einer endlichen Menge, Math. Z., 27, 544, 10.1007/BF01171114