Skip to main content
SpringerLink
Log in

From Words to Graphs, and Back

  • Conference paper
  • First Online:
Language and Automata Theory and Applications (LATA 2019)

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

Abstract

In 1918, Heinz Prüfer discovered a fascinating relationship between labelled trees with n vertices and words of length \(n-2\) over the alphabet \(\{1,2,\ldots ,n\}\). Since the discovery of the Prüfer code for trees, the interplay between words and graphs has repeatedly been explored and exploited in both directions. In the present paper, we review some of the many results in this area and discuss a number of open problems related to this topic.

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

Access this chapter

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

Institutional subscriptions

Notes

  1. 1.

    All logarithms are of base 2.

References

  1. Aigner, M., Ziegler, G.M.: Proofs from THE BOOK, 4th edn. Springer, Berlin (2010). https://doi.org/10.1007/978-3-642-00856-6

    Book  MATH  Google Scholar 

  2. Albert, M.H., Atkinson, M.D., Bouvel, M., Ruskuc, N., Vatter, V.: Geometric grid classes of permutations. Trans. Am. Math. Soc. 365, 5859–5881 (2013)

    Article  MathSciNet  Google Scholar 

  3. Alecu, B., Lozin, V., Zamaraev, V., de Werra, D.: Letter graphs and geometric grid classes of permutations: characterization and recognition. In: Brankovic, L., Ryan, J., Smyth, W.F. (eds.) IWOCA 2017. LNCS, vol. 10765, pp. 195–205. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-78825-8_16

    Chapter  Google Scholar 

  4. Alekseev, V.E.: Coding of graphs and hereditary classes. Probl. Cybernet. 39, 151–164 (1982). (in Russian)

    MATH  Google Scholar 

  5. Alekseev, V.E.: Range of values of entropy of hereditary classes of graphs. Diskret. Mat. 4(2), 148–157 (1992). (in Russian; translation in Discrete Mathematics and Applications, 3 (1993), no. 2, 191–199)

    MathSciNet  MATH  Google Scholar 

  6. Alekseev, V.E.: On lower layers of a lattice of hereditary classes of graphs. Diskretn. Anal. Issled. Oper. Ser. 4(1), 3–12 (1997). (Russian)

    MathSciNet  MATH  Google Scholar 

  7. Alon, N., Balogh, J., Bollobás, B., Morris, R.: The structure of almost all graphs in a hereditary property. J. Comb. Theory B 79, 131–156 (2011)

    MATH  Google Scholar 

  8. Atminas, A., Collins, A., Foniok, J., Lozin, V.: Deciding the Bell number for hereditary graph properties. SIAM J. Discrete Math. 30, 1015–1031 (2016)

    Article  MathSciNet  Google Scholar 

  9. Atminas, A., Lozin, V., Moshkov, M.: WQO is decidable for factorial languages. Inf. Comput. 256, 321–333 (2017)

    Article  MathSciNet  Google Scholar 

  10. Atminas, A., Brignall, R.: Well-quasi-ordering and finite distinguishing number. https://arxiv.org/abs/1512.05993

  11. Balogh, J., Bollobás, B., Weinreich, D.: The speed of hereditary properties of graphs. J. Comb. Theory Ser. B 79(2), 131–156 (2000)

    Article  MathSciNet  Google Scholar 

  12. Balogh, J., Bollobás, B., Weinreich, D.: A jump to the Bell number for hereditary graph properties. J. Comb. Theory B 95, 29–48 (2005)

    Article  MathSciNet  Google Scholar 

  13. Bollobás, B., Thomason, A.: Projections of bodies and hereditary properties of hypergraphs. Bull. London Math. Soc. 27, 417–424 (1995)

    Article  MathSciNet  Google Scholar 

  14. Bollobás, B., Thomason, A.: Hereditary and monotone properties of graphs. In: Graham, R.L., Nesetril, J. (eds.) The Mathematics of Paul Erdős, II. AC, vol. 14, pp. 70–78. Springer, Berlin (1997). https://doi.org/10.1007/978-3-642-60406-5_7

    Chapter  MATH  Google Scholar 

  15. Brignall, R., Ruškuc, N., Vatter, V.: Simple permutations: decidability and unavoidable substructures. Theor. Comput. Sci. 391, 150–163 (2008)

    Article  MathSciNet  Google Scholar 

  16. Cherlin, G.L., Latka, B.J.: Minimal antichains in well-founded quasi-orders with an application to tournaments. J. Comb. Theory B 80, 258–276 (2000)

    Article  MathSciNet  Google Scholar 

  17. Chvátal, V., Hammer, P.L.: Aggregation of inequalities in integer programming. Ann. Discrete Math. 1, 145–162 (1977)

    Article  MathSciNet  Google Scholar 

  18. Elizalde, S.: The X-class and almost-increasing permutations. Ann. Comb. 15, 51–68 (2011)

    Article  MathSciNet  Google Scholar 

  19. Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere!. Theor. Comput. Sci. 256, 63–92 (2001)

    Article  MathSciNet  Google Scholar 

  20. Galperin, H., Wigderson, A.: Succinct representations of graphs. Inf. Control 56, 183–198 (1983)

    Article  MathSciNet  Google Scholar 

  21. Higman, G.: Ordering by divisibility of abstract algebras. Proc. London Math. Soc. 2, 326–336 (1952)

    Article  MathSciNet  Google Scholar 

  22. Hine, N., Oxley, J.: When excluding one matroid prevents infinite antichains. Adv. Appl. Math. 45, 74–76 (2010)

    Article  MathSciNet  Google Scholar 

  23. Kannan, S., Naor, M., Rudich, S.: Implicit representation of graphs. SIAM J. Discrete Math. 5, 596–603 (1992)

    Article  MathSciNet  Google Scholar 

  24. Korpelainen, N., Lozin, V.V.: Two forbidden induced subgraphs and well-quasi-ordering. Discrete Math. 311, 1813–1822 (2011)

    Article  MathSciNet  Google Scholar 

  25. Kruskal, J.B.: Well-quasi-ordering, the tree theorem, and Vazsonyi’s conjecture. Trans. Am. Math. Soc. 95, 210–225 (1960)

    MathSciNet  MATH  Google Scholar 

  26. Kruskal, J.B.: The theory of well-quasi-ordering: a frequently discovered concept. J. Comb. Theory A 13, 297–305 (1972)

    Article  MathSciNet  Google Scholar 

  27. de Luca, A., Varricchio, S.: Well quasi-orders and regular languages. Acta Informatica 31, 539–557 (1994)

    Article  MathSciNet  Google Scholar 

  28. Mahadev, N.V.R., Peled, U.N.: Threshold graphs and related topics. Annals of Discrete Mathematics, vol. 56. North-Holland, Amsterdam (1995)

    MATH  Google Scholar 

  29. Petkovšek, M.: Letter graphs and well-quasi-order by induced subgraphs. Discrete Math. 244, 375–388 (2002)

    Article  MathSciNet  Google Scholar 

  30. Prüfer, H.: Neuer Beweis eines Satzes über Permutationen. Arch. Math. Phys. 27, 742–744 (1918)

    MATH  Google Scholar 

  31. Robertson, N., Seymour, P.D.: Graph minors. XX. Wagner’s conjecture. J. Comb. Theory Ser. B 92, 325–357 (2004)

    Article  MathSciNet  Google Scholar 

  32. Scheinerman, E.R., Zito, J.: On the size of hereditary classes of graphs. J. Comb. Theory Ser. B 61(1), 16–39 (1994)

    Article  MathSciNet  Google Scholar 

  33. Scheinerman, E.R.: Local representations using very short labels. Discrete Math. 203, 287–290 (1999)

    Article  MathSciNet  Google Scholar 

  34. Sonderegger, M.: Applications of graph theory to an English rhyming corpus. Comput. Speech Lang. 25, 655–678 (2011)

    Article  Google Scholar 

  35. Spielman, D.A., Bóna, M.: An infinite antichain of permutations. Electron. J. Comb. 7, 2 (2000)

    MathSciNet  Google Scholar 

  36. Spinrad, J.P.: Nonredundant 1’s in \(\varGamma \)-free matrices. SIAM J. Discrete Math. 8, 251–257 (1995)

    Article  MathSciNet  Google Scholar 

  37. Spinrad, J.P.: Efficient Graph Representations. Fields Institute Monographs, vol. 19, xiii+342 pp. American Mathematical Society, Providence (2003)

    Google Scholar 

  38. Vatter, V., Waton, S.: On partial well-order for monotone grid classes of permutations. Order 28, 193–199 (2011)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematics Institute, University of Warwick, Coventry, CV4 7AL, UK

    Vadim Lozin

Authors
  1. Vadim Lozin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Vadim Lozin .

Editor information

Editors and Affiliations

  1. Rovira i Virgili University, Tarragona, Spain

    Carlos Martín-Vide

  2. Saint Petersburg State University, St. Petersburg, Russia

    Alexander Okhotin

  3. Ariel University, Ariel, Israel

    Dana Shapira

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Lozin, V. (2019). From Words to Graphs, and Back. In: Martín-Vide, C., Okhotin, A., Shapira, D. (eds) Language and Automata Theory and Applications. LATA 2019. Lecture Notes in Computer Science(), vol 11417. Springer, Cham. https://doi.org/10.1007/978-3-030-13435-8_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-13435-8_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-13434-1

  • Online ISBN: 978-3-030-13435-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation