Degree Sequences in Complexes and Hypergraphs

@inproceedings{Dewdney2010DegreeSI,
  title={Degree Sequences in Complexes and Hypergraphs},
  author={Andrew Dewdney},
  year={2010}
}
Given an rc-complex K and a vertex v in K, the ndegree of v is the number of n-simplexes in K containing t7. The set of all Ti-degrees in a complex K is called its n-degree sequence when arranged in nonincreasing order. The question "Which sequences of integers are ndegree sequences?" is answered in this paper. This is done by generalizing the iterative characterization for the 1-dimensional (graphical) case due to V. Havel. A corollary to this general theorem yields the analogous… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-5 of 5 references

Graphes et hypergraphes

C. Berge
Dunod, Paris, • 1970

On the realizability of a set of integers as degrees of the vertices of a linear graph

S. Hakimi
I, J. Soc. Indust. Appl. Math • 1962

Graphs with prescribed degrees of vertices

P. Erdos, T. Gallai
Mat. Lapok • 1960
View 1 Excerpt

Homology theory: An introduction to algebraic topology

P. J. Hilton, S. Wylie
1960

Eine Bemerkunguber die Existenz der endlichen Graphen

V. Havel
Casopis Pest. Mat • 1955
View 1 Excerpt

Similar Papers

Loading similar papers…