Geodesic
On the Hypercompetition Numbers of Hypergraphs with Maximum Degree at Most Two
Discussiones Mathematicae. Graph Theory, Tome 35 (2015) no. 3, pp. 595-598

Voir la notice de l'article provenant de la source Library of Science

In this note, we give an easy and short proof for the theorem by Park and Kim stating that the hypercompetition numbers of hypergraphs with maximum degree at most two is at most two.
Keywords: digraph, competition hypergraph, hypercompetition number 
@article{DMGT_2015_35_3_a16,
     author = {Sano, Yoshio},
     title = {On the {Hypercompetition} {Numbers} of {Hypergraphs} with {Maximum} {Degree} at {Most} {Two}},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {595--598},
     publisher = {mathdoc},
     volume = {35},
     number = {3},
     year = {2015},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2015_35_3_a16/}
}
TY  - JOUR
AU  - Sano, Yoshio
TI  - On the Hypercompetition Numbers of Hypergraphs with Maximum Degree at Most Two
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2015
SP  - 595
EP  - 598
VL  - 35
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2015_35_3_a16/
LA  - en
ID  - DMGT_2015_35_3_a16
ER  - 
%0 Journal Article
%A Sano, Yoshio
%T On the Hypercompetition Numbers of Hypergraphs with Maximum Degree at Most Two
%J Discussiones Mathematicae. Graph Theory
%D 2015
%P 595-598
%V 35
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2015_35_3_a16/
%G en
%F DMGT_2015_35_3_a16
Sano, Yoshio. On the Hypercompetition Numbers of Hypergraphs with Maximum Degree at Most Two. Discussiones Mathematicae. Graph Theory, Tome 35 (2015) no. 3, pp. 595-598. http://geodesic.mathdoc.fr/item/DMGT_2015_35_3_a16/