Skip to main content
SpringerLink
Log in

Finite Paths are Universal

  • Published:
Order Aims and scope Submit manuscript

Abstract

We prove that any countable (finite or infinite) partially ordered set may be represented by finite oriented paths ordered by the existence of homomorphism between them. This (what we believe a surprising result) solves several open problems. Such path-representations were previously known only for finite and infinite partial orders of dimension 2. Path-representation implies the universality of other classes of graphs (such as connected cubic planar graphs). It also implies that finite partially ordered sets are on-line representable by paths and their homomorphisms. This leads to a new on-line dimensions.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Babai, L.: Automorphism groups of graphs and edge contraction, Discrete Math. 8 (1974), 13–22.

    Article  MATH  MathSciNet  Google Scholar 

  2. Babai, L. and Pultr, A.: Endomorphism monoids and topological subgraphs of graphs, J. Comb. Theory B 28?>(3) (1980), 278–283.

    Article  MATH  MathSciNet  Google Scholar 

  3. Cherlin, G. L.: The Classification of Countable Homogeneous Directed Graphs and Countable Homogeneous n-tournaments. Memoirs Amer. Math. Soc. 621, American Mathematical Society, Providence, Rhode Island, 1998.

  4. Hedrlín, Z.: On universal partly oriented sets and classes, J. Algebra 11 (1969), 503–509.

    Article  MATH  MathSciNet  Google Scholar 

  5. Hell, P., Nešetřil, J. and Zhu, X.: Duality and polynomial testing of tree homomorphisms, Trans. Am. Math. Soc. 348 (1996), 1281–1297.

    Article  MATH  Google Scholar 

  6. Hell, P. and Nešetřil, J.: Groups and monoids of regular graphs and of graphs with bounded degree, Can. J. Math. XXV 2 (1973), 239–251.

    Google Scholar 

  7. Fraïssé, R.: Theory of Relations, North-Holland, Amsterdam, 1953.

    Google Scholar 

  8. Gambosi, G., Nešetřil, J., Talamo, M.: On locally presented posets, Theor. Comp. Sci. 70(12) (1990), 251–260.

    Article  MATH  Google Scholar 

  9. Hodges, W.: Model Theory, Cambridge University Press, 1993.

  10. Hubička, J. and Nešetřil, J.: On Homogeneous Graphs and Posets, KAM-DIMATIA Series 606, Charles University, 2003.

    Google Scholar 

  11. Hubička, J. and Nešetřil, J.: Universal partial order represented by means of trees and other simple graphs, Eur. J. Comb. 26 (2005), 765–778.

    Article  Google Scholar 

  12. Janáček, L.: On an Overgrown Path (Po zarostlém chodníčku), 1902.

  13. Nešetřil, J.: Aspects of structural combinatorics, Taiwan. J. Math. 3(4) (1999), 381–424.

    Google Scholar 

  14. Nešetřil, J. and Pudlák, P.: A note on Boolean dimension of posets. in W. Deuber and V. T. Sós (eds.), Irregularities of Partitions Algorithms and Combinatorics 8, Springer, Berlin Heidelberg New York, 1989, pp. 137–140.

    Google Scholar 

  15. Nešetřil, J. and Rödl, V.: Combinatorial partitions of finite posets and lattices – Ramsey lattices, Algebra Univers. 19 (1994), 106–119.

    Article  Google Scholar 

  16. Trotter, W. T.: Dimension Theory, John Hopkins Univ. Press, 1992.

  17. Nešetřil, J. and Zhu, X.: Path homomorphisms, Math. Proc. Comb. Phil. Soc. (1996), 207–220.

  18. Pultr, A. and Trnková, V.: Combinatorial, Algebraic and Topological Representations of Groups, Semigroups and Categories, North Holland, 1980.

  19. Schmerl, J. H.: Countable homogeneous partially ordered sets, Algebra Univers. 9 (1979), 317–321.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics, Charles University, Malostranské nám. 25, 11800, Praha, Czech Republic

    Jan Hubička & Jaroslav Nešetřil

  2. Institute of Theoretical Computer Sciences (ITI), Charles University, Malostranské nám. 25, 11800, Praha, Czech Republic

    Jan Hubička & Jaroslav Nešetřil

Authors
  1. Jan Hubička
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jaroslav Nešetřil
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jan Hubička.

Additional information

*Supported by Grants LN00A56 and 1M0021620808 of the Czech Ministry of Education. The first author was partially supported by EU network COMBSTRU at UPC Barcelona.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hubička, J., Nešetřil, J. Finite Paths are Universal. Order 22, 21–40 (2005). https://doi.org/10.1007/s11083-005-9005-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11083-005-9005-x

Keywords

Search

Navigation