Skip to main content
SpringerLink
Log in

Directed Tree Decompositions

  • Conference paper
Formal Concept Analysis (ICFCA 2014)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 8478))

Included in the following conference series:

Abstract

In the problem session of the ICFCA 2006, Sándor Radeleczki asked for the meaning of the smallest integer k such that a given poset can be decomposed as the union of k directed trees. The problem also asks for the connection of this number to the order dimension. Since it was left open what kind of decomposition might be used, there is more than one reading of this problem. In the paper, we discuss different versions and give some answers to this open problem.

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Czédli, G., Hartmann, M., Schmidt, E.T.: CD-independent subsets in distributive lattices. Publ. Math. Debrecen 74(1-2), 127–134 (2009)

    MATH  MathSciNet  Google Scholar 

  2. Dilworth, R.P.: A decomposition theorem for partially ordered sets. Ann. of Math. (2)51, 161–166 (1950)

    Google Scholar 

  3. Hiraguti, T.: On the dimension of orders. Sci. Rep. Kanazawa Univ. 4(1), 1–20 (1955)

    MATH  MathSciNet  Google Scholar 

  4. Horváth, E.K., Radeleczki, S.: Notes on CD-independent subsets. Acta Sci. Math (Szeged) 78(1-2), 3–24 (2012)

    MATH  MathSciNet  Google Scholar 

  5. Mirsky, L.: A dual of Dilworth’s decomposition theorem. Amer. Math. Monthly 78, 876–877 (1971)

    Article  MATH  MathSciNet  Google Scholar 

  6. Trotter, W.T.: Combinatorics and partially ordered sets, Dimension theory. Johns Hopkins University Press, Baltimore (1992) (Dimension theory. Johns Hopkins Series in the Mathematical Sciences)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Technische Universität Dresden, 01062, Dresden, Germany

    Sebastian Kerkhoff & Friedrich Martin Schneider

Authors
  1. Sebastian Kerkhoff
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Friedrich Martin Schneider
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Technische Universität Dresden, 01062, Dresden, Germany

    Cynthia Vera Glodeanu

  2. INSA-Lyon, CNRS, LIRIS UMR 5205, 9621, 69621, Lyon, France

    Mehdi Kaytoue

  3. Babes-Bolyai University, 400084, Cluj, Romania

    Christian Sacarea

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Kerkhoff, S., Schneider, F.M. (2014). Directed Tree Decompositions. In: Glodeanu, C.V., Kaytoue, M., Sacarea, C. (eds) Formal Concept Analysis. ICFCA 2014. Lecture Notes in Computer Science(), vol 8478. Springer, Cham. https://doi.org/10.1007/978-3-319-07248-7_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-07248-7_7

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-07247-0

  • Online ISBN: 978-3-319-07248-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation