Maximal hypergraphs with respect to the bounded cost hereditary property

Ewa Drgas-Burchardt; Anna Fiedorowicz

Discussiones Mathematicae Graph Theory (2005)

  • Volume: 25, Issue: 1-2, page 67-77
  • ISSN: 2083-5892

Abstract

top
The hereditary property of hypergraphs generated by the cost colouring notion is considered in the paper. First, we characterize all maximal graphs with respect to this property. Second, we give the generating function for the sequence describing the number of such graphs with the numbered order. Finally, we construct a maximal hypergraph for each admissible number of vertices showing some density property. All results can be applied to the problem of information storage.

How to cite

top

Ewa Drgas-Burchardt, and Anna Fiedorowicz. "Maximal hypergraphs with respect to the bounded cost hereditary property." Discussiones Mathematicae Graph Theory 25.1-2 (2005): 67-77. <http://eudml.org/doc/270776>.

@article{EwaDrgas2005,
abstract = {The hereditary property of hypergraphs generated by the cost colouring notion is considered in the paper. First, we characterize all maximal graphs with respect to this property. Second, we give the generating function for the sequence describing the number of such graphs with the numbered order. Finally, we construct a maximal hypergraph for each admissible number of vertices showing some density property. All results can be applied to the problem of information storage.},
author = {Ewa Drgas-Burchardt, Anna Fiedorowicz},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {cost colouring; hereditary property; maximal hypergraphs},
language = {eng},
number = {1-2},
pages = {67-77},
title = {Maximal hypergraphs with respect to the bounded cost hereditary property},
url = {http://eudml.org/doc/270776},
volume = {25},
year = {2005},
}

TY - JOUR
AU - Ewa Drgas-Burchardt
AU - Anna Fiedorowicz
TI - Maximal hypergraphs with respect to the bounded cost hereditary property
JO - Discussiones Mathematicae Graph Theory
PY - 2005
VL - 25
IS - 1-2
SP - 67
EP - 77
AB - The hereditary property of hypergraphs generated by the cost colouring notion is considered in the paper. First, we characterize all maximal graphs with respect to this property. Second, we give the generating function for the sequence describing the number of such graphs with the numbered order. Finally, we construct a maximal hypergraph for each admissible number of vertices showing some density property. All results can be applied to the problem of information storage.
LA - eng
KW - cost colouring; hereditary property; maximal hypergraphs
UR - http://eudml.org/doc/270776
ER -

References

top
  1. [1] C. Berge, Hypergraphs (North-Holland, Amsterdam, 1989). 
  2. [2] E. Kubicka and A.J. Schwenk, An introduction to chromatic sums, in: Proceedings of the Seventeenth, Annual ACM Computer Sciences Conference (ACM Press) (1989) 39-45. 
  3. [3] J. Mitchem and P. Morriss, On the cost chromatic number of graphs, Discrete Math. 171 (1997) 201-211, doi: 10.1016/S0012-365X(96)00005-2. Zbl0876.05031
  4. [4] J. Riordan, An Introduction to Combinatorial Analysis (New York, 1958). Zbl0078.00805

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.