Skip to main content
SpringerLink
Log in
Book cover

International Computing and Combinatorics Conference

COCOON 2018: Computing and Combinatorics pp 391–402Cite as

An Efficiently Recognisable Subset of Hypergraphic Sequences

  • Conference paper
  • First Online:

  • 1402 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10976))

Abstract

The problem of efficiently characterizing degree sequences of simple hypergraphs (without repeated hyper-edges) is a fundamental long-standing open problem in Graph Theory. Several results are known for restricted versions of this problem. This paper adds to the list of sufficient conditions for a degree sequence to be hypergraphic and proposes a polynomial time algorithm which correctly identifies at least \(2^{\frac{(n-1)(n-2)}{2}}\) hypergraphic sequences. For comparison, the number of hypergraphic sequences on n vertices is at most \(2^{n\cdot (n-1)}\).

S. M. Meesum—Supported by the NCN grant number 2015/18/E/ST6/00456. This work was partially done at the Institute of Mathematical Sciences, HBNI, India.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Notes

  1. 1.

    A loopless graph without repeated edges.

References

  1. Achuthan, N., Achuthan, N., Simanihuruk, M.: On 3-uniform hypergraphic sequences. J. Comb. Math. Comb. Comput 14, 3–13 (1993)

    MathSciNet  MATH  Google Scholar 

  2. Behrens, S., Erbes, C., Ferrara, M., Hartke, S.G., Reiniger, B., Spinoza, H., Tomlinson, C.: New results on degree sequences of uniform hypergraphs. Electron. J. Comb. 20(4), P14 (2013)

    MathSciNet  MATH  Google Scholar 

  3. Bhave, N.S., Bam, B., Deshpande, C.: 13 a characterization of degree sequences of linear hypergraphs. J. Indian Math. Soc. 75(1), 151 (2008)

    MathSciNet  MATH  Google Scholar 

  4. Billington, D.: Conditions for degree sequences to be realisable by 3-uniform hypergraphs. J. Comb. Math. Comb. Comput. 3, 71–91 (1988)

    MathSciNet  MATH  Google Scholar 

  5. Boonyasombat, V.: Degree sequences of connected hypergraphs and hypertrees. In: Koh, K.M., Yap, H.P. (eds.) Graph Theory Singapore 1983. LNM, vol. 1073, pp. 236–247. Springer, Heidelberg (1984). https://doi.org/10.1007/BFb0073123

    Chapter  Google Scholar 

  6. Choudum, S.A.: On graphic and 3-hypergraphic sequences. Discrete Math. 87(1), 91–95 (1991)

    Article  MathSciNet  Google Scholar 

  7. Colbourn, C.J., Kocay, W.L., Stinson, D.R.: Some NP-complete problems for hypergraph degree sequences. Discrete Appl. Math. 14(3), 239–254 (1986)

    Article  MathSciNet  Google Scholar 

  8. Dewdney, A.K.: Degree sequences in complexes and hypergraphs. Proc. Am. Math. Soc. 53(2), 535–540 (1975)

    Article  MathSciNet  Google Scholar 

  9. Deza, A., Levin, A., Meesum, S.M., Onn, S.: Optimization over degree sequences. arXiv preprint arXiv:1706.03951 (2017)

  10. Ferrara, M.: Some problems on graphic sequences. Graph Theory Notes N. Y. 64, 19–25 (2013)

    MathSciNet  Google Scholar 

  11. Gallai, P.E.T., Erdos, P.: Graphs with prescribed degree of vertices (Hungarian), Mat. Lapok 11, 264–274 (1960)

    MATH  Google Scholar 

  12. Hakimi, S.L.: On realizability of a set of integers as degrees of the vertices of a linear graph. I. J. Soc. Ind. Appl. Math. 10(3), 496–506 (1962). SIAM

    Article  MathSciNet  Google Scholar 

  13. Hakimi, S.L., Schmeichel, E.F.: Graphs and their degree sequences: a survey. In: Alavi, Y., Lick, D.R. (eds.) Theory and applications of graphs, pp. 225–235. Springer, Heidelberg (1978). https://doi.org/10.1007/BFb0070380

    Chapter  MATH  Google Scholar 

  14. Havel, V.: A remark on the existence of finite graphs. Casopis Pest. Mat. 80(477–480), 1253 (1955)

    Google Scholar 

  15. Keranen, M.S., Kreher, D., Kocay, W., Li, P.C.: Degree sequence conditions for partial steiner triple systems. Bull. Inst. Comb. Appl 57, 71–73 (2009)

    MathSciNet  MATH  Google Scholar 

  16. Khan, M.: Characterizing the degree sequences of hypergraphs, August 2015. https://open.library.ubc.ca/cIRcle/collections/48630/items/1.0228065

  17. Rao, S.B.: A survey of the theory of potentially P-graphic and forcibly P-graphic degree sequences. In: Rao, S.B. (ed.) Combinatorics and Graph Theory. LNM, vol. 885, pp. 417–440. Springer, Heidelberg (1981). https://doi.org/10.1007/BFb0092288

    Chapter  Google Scholar 

  18. Sahakyan, H., Aslanyan, L.: Evaluation of greedy algorithm of constructing (0, 1)-matrices with different rows. Int. J. Inf. Technol. Knowl. 5(1), 55–66 (2011)

    Google Scholar 

  19. Sierksma, G., Hoogeveen, H.: Seven criteria for integer sequences being graphic. J. Graph theory 15(2), 223–231 (1991)

    Article  MathSciNet  Google Scholar 

  20. Tyshkevich, R., Chernyak, A., Chernyak, Z.A.: Graphs and degree sequences. i. Cybernetics 23(6), 734–745 (1987)

    Article  MathSciNet  Google Scholar 

  21. Tyshkevich, R., Chernyak, A., Chernyak, Z.A.: Graphs and degree sequences: a survey. iii. Cybernetics 24(5), 539–548 (1988)

    Article  MathSciNet  Google Scholar 

  22. Tyshkevich, R., Chernyak, A., Chernyak, Z.A.: Graphs and degree sequences. ii. Cybernetics 24(2), 137–152 (1988)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, University of Wrocław, Wrocław, Poland

    Syed M. Meesum

Authors
  1. Syed M. Meesum
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Syed M. Meesum .

Editor information

Editors and Affiliations

  1. City University of Hong Kong, Hong Kong, China

    Lusheng Wang

  2. Shandong University, Jinan, China

    Daming Zhu

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Meesum, S.M. (2018). An Efficiently Recognisable Subset of Hypergraphic Sequences. In: Wang, L., Zhu, D. (eds) Computing and Combinatorics. COCOON 2018. Lecture Notes in Computer Science(), vol 10976. Springer, Cham. https://doi.org/10.1007/978-3-319-94776-1_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-94776-1_33

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-94775-4

  • Online ISBN: 978-3-319-94776-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation