Hostname: page-component-8448b6f56d-sxzjt Total loading time: 0 Render date: 2024-04-24T12:09:56.297Z Has data issue: false hasContentIssue false
  • English
  • Français

Dimension invariance of subdivisions

Published online by Cambridge University Press:  17 April 2009

Jeh Gwon Lee ,
Wei-Ping Liu ,
Richard Nowakowski  and
Ivan Rival
Jeh Gwon Lee
Affiliation:
Department of Mathematics, Sogang University, Seoul, 121–742, Korea
Wei-Ping Liu
Affiliation:
Department of Mathematics, Dalhousie University, Halifax, B3H 4H8, Canada
Richard Nowakowski
Affiliation:
Department of Computer Science, University of Ottawa, K1N 6N5, Canada
Ivan Rival
Affiliation:
Department of Computer Science, University of Ottawa, K1N 6N5, Canada
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

The dimension of an ordered set is invariant with respect to any subdivision of its completion. This may be applied to support the conjecture (still open) that the problem to determine the (order) dimension of an N-free ordered set is NP-complete.

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 63 , Issue 1 , February 2001 , pp. 141 - 150
Copyright
Copyright © Australian Mathematical Society 2001

References

[1]Habib, M., ‘The calculation of invariants for ordered sets’, in Algorithms and order, (Rival, I., Editor) (Kluwer Academic Publisher, Dordecht, 1989), pp. 231–279.Google Scholar
[2]Rival, I., ‘Lattices and partially ordered sets’, in Problems combinatoires et theorie des graphes, Orsay, 1976, Colloq. Int. CNRS 260, 1978, pp. 349–351.Google Scholar
[3]Spinrad, J., ‘Edge subdivision and dimension’, Order 5 (1988), 143–147.CrossRefGoogle Scholar
[4]Yannakakis, M., ‘The complexity of the partial order dimension problem’, SIAM J. Algebraic Discrete Methods 3 (1982), 351–358.CrossRefGoogle Scholar