On the Hypercompetition Numbers of Hypergraphs with Maximum Degree at Most Two

Yoshio Sano

Discussiones Mathematicae Graph Theory (2015)

  • Volume: 35, Issue: 3, page 595-598
  • ISSN: 2083-5892

Abstract

top
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.

How to cite

top

Yoshio Sano. "On the Hypercompetition Numbers of Hypergraphs with Maximum Degree at Most Two." Discussiones Mathematicae Graph Theory 35.3 (2015): 595-598. <http://eudml.org/doc/271239>.

@article{YoshioSano2015,
abstract = {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.},
author = {Yoshio Sano},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {digraph; competition hypergraph; hypercompetition number.; hypercompetition number},
language = {eng},
number = {3},
pages = {595-598},
title = {On the Hypercompetition Numbers of Hypergraphs with Maximum Degree at Most Two},
url = {http://eudml.org/doc/271239},
volume = {35},
year = {2015},
}

TY - JOUR
AU - Yoshio Sano
TI - On the Hypercompetition Numbers of Hypergraphs with Maximum Degree at Most Two
JO - Discussiones Mathematicae Graph Theory
PY - 2015
VL - 35
IS - 3
SP - 595
EP - 598
AB - 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.
LA - eng
KW - digraph; competition hypergraph; hypercompetition number.; hypercompetition number
UR - http://eudml.org/doc/271239
ER -

References

top
  1. [1] B. Park and S.-R. Kim, On Opsut’s conjecture for hypercompetition numbers of hypergraphs, Discrete Appl. Math. 160 (2012) 2286-2293. doi:10.1016/j.dam.2012.05.009[WoS][Crossref] Zbl1252.05156
  2. [2] B. Park and Y. Sano, On the hypercompetition numbers of hypergraphs, Ars Combin. 100 (2011) 151-159. Zbl1265.05449
  3. [3] M. Sonntag and H.-M. Teichert, Competition hypergraphs, Discrete Appl. Math. 143 (2004) 324-329. doi:10.1016/j.dam.2004.02.010[Crossref] 

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.