Arrow, K. J.
(1963). Social Choice and Individual Values.
New York: John
Wiley.
2.
Berge, C.
(1970). Graphes et hypergraphes.
Paris:
Dunod.
3.
Erdös, P.
(1969).
“On a Combinatorial Problem III.”Canadian Mathematical Bulletin12:
413–16.
4.
Erdös, P.
,
Chao Ko
and
R. Rado
. (1961).
“Intersection Theorems for Systems of Finite
Sets.”Quarterly Journal of Mathematics Oxford (2). 12:
313–20.
5.
Erdös, P.
, and
D. Kleitman
. (1974).
“Extremal Problems among Subsets of a Set.”Discrete Mathematics8:
281–94.
6.
Erdös, P.
, and
L. Lovász
. (1975). “Problems and Results on 3-Chromatic
Hyper-graphs and Some Related Questions.” In Infinite
and Finite Sets, Vol., II. Ed.
A. Hajnal
,
R. Rado
, and
V. T. Sos
. Amsterdam:
North-Holland. Pp.
609–27.
7.
Hilton, A. J. W.
(1975).
“Analogues of a Theorem of Erdös, Ko and Rado on a
Family of Finite Sets.”Quarterly Journal of Mathematics (Oxford) (2) 25:
19–28.
8.
Katona, G. O. H.
(1974). “Extremal Problems for
Hypergraphs.” In Combinatorics; Ed.
M. Hall
and
J.H. van Lint
.
Mathematical Centre Tracts
56: 13–42.
9.
Kleitman, D. J.
, and
G. Markowsky
. (1975).
“On Dedekind's Problem: The Number of Isotone Boolean
Functions, II”Transactions of the American Mathematical Society213:
373–90.
10.
Koster, M. B. M. de
,
J. H. P. Paelinck
, and
P. H. Vossen
. (1983). “Analysis and Measurement of
Conflicts.” To appear in: Proceedings of the
World University Congress.
Tokyo.
11.
Milner, E. C.
(1968).
“A Combinatorial Theorem on Systems of Sets.”Journal of the London Mathematical Society43:
204–06.
12.
Monjardet, B.
(1978).
“An Axiomatic Theory of Tournament Aggregation.”Mathematics of Operations Research3(4):
334–51.
13.
Moulin, H.
(1983). The Strategy of Social Choice.
Amsterdam:
North-Holland.
14.
Sperner, E.
(1928).
“Ein Satz über Untermengen einer endlichen
Menge.”Mathematische Zeitschrift27:
544–48.
