On existence of hypergraphs with prescribed edge degree profile

1Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

The degree profile of an edge e of a finite hypergraph H is the map assigning to a positive integer i the number of vertices of degree i incident with e. The edge degree profile of H is the map describing for any possible degree profile α the number of edges in H with degree profile α. A necessary and sufficient condition for existence of hypergraphs of prescribed edge degree profile is found. A similar result concerning hypergraphs without multiple edges is also presented. © 1995.

Cite

CITATION STYLE

APA

Horňák, M., Lauff, R., & Soták, R. (1995). On existence of hypergraphs with prescribed edge degree profile. Discrete Mathematics, 146(1–3), 109–121. https://doi.org/10.1016/0012-365X(94)00158-5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free