References
- B.D. Acharya, Unpublished Manuscript, MRI, 1979. Recently published as: B.D. Acharya, Representing hypergraphs by families of sets with given properties, Indian J. Math., 51 (3) (2009), 597–609.
- Z. Baranyai, On the factorization of the complete uniform hypergraph, Infinite and Finite Sets (A. Hajnal, R. Rado, V.T. Sós, eds.), North Holland, Amsterdam 1975, 91–108.
- C. Berge, The Theory of Graphs, Dover Publications, New York 2001.
- C. Berge, Hypergraphs. Combinatorics of Finite Sets, Elsevier Science Publishers, Amsterdam 1989.
- C. Berge, Regularisable Graphs, Advances in Graph Theory (Bollobás, ed.), Annals of Discrete Math., 3 (1978), 11–20.
- C. Berge and P. Duchet, Une généralisation du théorème de Gilmore, Cahier du C.E.R.O., 17 (1975), 111–124.
- C. Berge and M. Las Vergnas, Sur un théoreme du type König pour hypergraphes, Annals N.Y. Acad. Sc., 175 (1970), 32–40.
- B. Bollobás and P. Duchet, Helly Families of Maximal Size, J. Comb. Theory A, 26 (1979), 197–200.
- B. Bollobás and P. Duchet, On Helly Families of Maximal Size, J. Comb. Theory B, 35 (1983), 290–296.
- J.A. Bondy and U.S.R. Murty, Graph Theory with Applications, Springer Verlag, 2008.
- P. Erdös, Cha-Ko, and R. Rado, Intersection Theorems for Systems of Finite Size, Quart. J. Math. Oxford, 12 (1961), 313–318.
- P. Erdös, A. Hajnal, and J.W. Moon, Mathematical Notes, Amer. Math. Monthly, 71 (1964), 1107–1110.
- Z. Füredi, Maximum Degrees and Fractional Matchings in Uniform Hypergraphs, Combinatorica, 1 (1981), 155–162.
- H. Galeana-Sánchez and M. Manrique, Level Hypergraphs, AKCE Int. J. Graphs Comb., 6 (2009), 409–427.
- H. Galeana-Sánchez and M. Manrique, Directed hypergraphs: A tool for researching digraphs and hypergraphs, Discuss. Math. Graph Theory, 29 (2009), 313–335.
- C. Greene, G.O.H. Katona, and D.J. Kleitman, Extensions to the Erdös-Ko-Rado Theorem, Recent Advances in Graph Theory, Academia Praha 1975, 223–231.
- P. Hansen and M. Loréa, Deux conditions de colorabilité des hypergraphes, Coll. Math. Discrete, Bruxelles 1978, Cahiers du C.E.R. O. 20 (1978), p. 3–4, 405–410.
- J. Henderson and R.A. Dean, The 1-width of (0, 1)-matrices having constant sum three, J. Comb. Theory A, 16 (1974), 355–370.
- F. Jaeger and C. Payan, Détermination du nombre d'aretes d'une hypergraphe τ-critique, C.R. Acad. Sci. Paris, 271 (1961), 221–223.
- L. Lovász, 2-matchings and 2-covers of hypergraphs, Acta Math. Ac. Sci. Hungar, 16 (1975), 50–57.
- C. Payan, Coverings by Minimal Transversals, Discrete Math., 23 (1978), 273–277.
- H. Ryser, New Types of Combinatorial Designs, Actes Congrès International des mathématiciens, Nice 3 (1970), 235–239.
- J. Schönheim, On a Problem of Daykin Concerning Intersecting Families of Sets, Combinatorics, London Math. Soc. Lecture Notes Series 13, Cambridge Univ. Press (1974), 139–140.
- E. Sperner, Ein Satz über Untermengen einer endlichen Menge, Math. Z., 27 (1928), 544–548.
- F. Sterboul, Sur le nombre transversal des hypergraphes uniformes, Discrete Math., 22 (1978), 91–96.
- Z. Tuza, Helly-type Hypergraphs and Sperner Families, Europ. J. Combinatorics, 5 (1984), 185–187.