On Hypergraph Degree Sequence Characterisation

Authors

  • H. Sahakyan Institute for Informatics and Automation Problems of NAS RA
  • L. Aslanyan Institute for Informatics and Automation Problems of NAS RA

Abstract

N/A

References

Aslanyan L.A., Isoperimetry problem and related extremal problems of discrete spaces, Problemy Kibernetiki, 36, pp. 85-126 (1979).

Berge C., Hypergraphs. North Holland, Amsterdam, 1989.

Bhanu Murthy N.L. and Murali K. Srinivasan, The polytope of degree sequences of hypergraphs. Linear algebra and its applications, 350 (2002), 147-170.

Billington D., Conditions for degree sequences to be realizable by 3-uniform hypergraphs". The Journal of Combinatorial Mathematics and Combinatorial Computing". 3, 1988, 71-91.

Colbourn Charles J., Kocay W.L. and Stinson D.R.,Some NP-complete problems for hypergraph degree sequences. Discrete Applied Mathematics 14, p. 239-254 (1986).

Kocay, W., Li, P.C., On degree sequences of hypergraphs, Ars Combin. 82 (2007), 145-157.

Ryser G.J., Combinatorial Mathematics, 1966.

Sahakyan H., Numerical characterization of n-cube subset partitioning, Discrete Applied Mathematics 157 (2009) 2191-2197.

Downloads

Published

2021-12-10

How to Cite

Sahakyan, H., & Aslanyan, L. (2021). On Hypergraph Degree Sequence Characterisation. Mathematical Problems of Computer Science, 38, 89–90. Retrieved from http://mpcs.sci.am/index.php/mpcs/article/view/576

Issue

Vol. 38 (2012): Mathematical Problems of Computer Science

Section

Conference papers

License

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.