On the Hypercompetition Numbers of Hypergraphs with Maximum Degree at Most Two
| Autor: | Sano Yoshio |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2015 |
| Předmět: | |
| Zdroj: | Discussiones Mathematicae Graph Theory, Vol 35, Iss 3, Pp 595-598 (2015) |
| Druh dokumentu: | article |
| ISSN: | 2083-5892 |
| DOI: | 10.7151/dmgt.1826 |
| Popis: | 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. |
| Databáze: | Directory of Open Access Journals |
| Externí odkaz: |
|