Geodesic
Extremal Point and Edge Sets in n-Graphs
Canadian journal of mathematics, Tome 21 (1969) no. 1, pp. 1069-1075

Voir la notice de l'article provenant de la source Cambridge University Press

A set of points (edges) of a graph is independent if no two distinct members of the set are adjacent. Gallai (1) observed that, if A 0 (B 0) is the minimum number of points (edges) of a finite graph covering all the edges (points) and A 1 (B 1) is the maximum number of independent points (edges), then: holds, where m is the number of points of the graph.The concepts of independence and covering are generalized in various ways for n-graphs. In this paper we establish certain connections between the corresponding extreme numbers analogous to the above result of Gallai.Ray-Chaudhuri considered (2) independence and covering problems in n-graphs and determined algorithms for finding the minimal cover and some associated numbers. 
Sauer, N. Extremal Point and Edge Sets in n-Graphs. Canadian journal of mathematics, Tome 21 (1969) no. 1, pp. 1069-1075. doi: 10.4153/CJM-1969-118-3
@article{10_4153_CJM_1969_118_3,
     author = {Sauer, N.},
     title = {Extremal {Point} and {Edge} {Sets} in {n-Graphs}},
     journal = {Canadian journal of mathematics},
     pages = {1069--1075},
     year = {1969},
     volume = {21},
     number = {1},
     doi = {10.4153/CJM-1969-118-3},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CJM-1969-118-3/}
}
TY  - JOUR
AU  - Sauer, N.
TI  - Extremal Point and Edge Sets in n-Graphs
JO  - Canadian journal of mathematics
PY  - 1969
SP  - 1069
EP  - 1075
VL  - 21
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CJM-1969-118-3/
DO  - 10.4153/CJM-1969-118-3
ID  - 10_4153_CJM_1969_118_3
ER  - 
%0 Journal Article
%A Sauer, N.
%T Extremal Point and Edge Sets in n-Graphs
%J Canadian journal of mathematics
%D 1969
%P 1069-1075
%V 21
%N 1
%U http://geodesic.mathdoc.fr/articles/10.4153/CJM-1969-118-3/
%R 10.4153/CJM-1969-118-3
%F 10_4153_CJM_1969_118_3

[1] 1. Gallai, T., Über extreme Punkt- und Kantenmengen, Ann. Univ. Sci. Budapest Eôtvôs Sect. Math. 2 (1959), 133–138. Google Scholar

[2] 2. Ray-Chaudhuri, D. K., An algorithm for a minimum cover of an abstract complex, Can. J. Math. 15 (1963), 11–24. Google Scholar

Cité par Sources :