Graphs and k-Societies
Canadian mathematical bulletin, Tome 13 (1970) no. 3, pp. 375-381
Voir la notice de l'article provenant de la source Cambridge University Press
A graph G is a couple (X, R) where X is a set, R ⊂ X × X. If G is an undirected graph without loops (R a symmetric irreflexive relation), we can interpret G as a couple (X, R), where R is a set of two-element subsets of X, i.e. . This interpretation is generalized in the notion of society.A society is a couple (X, R), where ; a k-society is a society (X, R) with |A| = k for each A ∊ R.
Hell, Pavol; Nešetřil, Jaroslav. Graphs and k-Societies. Canadian mathematical bulletin, Tome 13 (1970) no. 3, pp. 375-381. doi: 10.4153/CMB-1970-071-3
@article{10_4153_CMB_1970_071_3,
author = {Hell, Pavol and Ne\v{s}et\v{r}il, Jaroslav},
title = {Graphs and {k-Societies}},
journal = {Canadian mathematical bulletin},
pages = {375--381},
year = {1970},
volume = {13},
number = {3},
doi = {10.4153/CMB-1970-071-3},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1970-071-3/}
}
[1] 1. Berge, C., Theory of graphs and their applications, J. Wiley, New York, 1962. Google Scholar
[2] 2. Hedrlin, Z., Pultr, A.: Symetrie relations (undirected graphs) with given semigroup, Mhf. fiir Math. 68 (1965), 318-322. Google Scholar
[3] 3. Mendelsohn, E., Sips, products, and graphs with given semigroup, (to appear). Google Scholar
[4] 4. Pultr, A., On selecting ofmorphisms, CMUC (1), 8 (1967), 53-83. Google Scholar
[5] 5. Vopěnka, P., Pultr, A., Hedrlin, Z., A rigid relation exists on any set CMUC (2), 6 (1965), 149-155. Google Scholar
Cité par Sources :