Contents

Ars Combinatoria

  • Research article

Note on Transformation of Posets with the Same Semi Bound Graphs

Hiroshi Era1, Kenjiro Ogawa2, Morimasa Tsuchiya2,3
1Faculty of Information and Communication Bunkyo University Chgasaki 253-0007, Japan
2Department of Mathematical Sciences, Tokai University Hiratsuka 259-1292, Japan
3Department of Mathematics, MIT Cambridge MA 02139-4307, USA
  • Published: 31/07/2005

Abstract

In this paper, we consider transformations between posets \(P\) and \(Q\), whose semi bound graphs are the same. Those posets with the same double canonical posets can be transformed into each other by a finite sequence of two kinds of transformations, called \(d\)-additions and \(d\)-deletions.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Hiroshi Era, Kenjiro Ogawa, Morimasa Tsuchiya. Note on Transformation of Posets with the Same Semi Bound Graphs[J], Ars Combinatoria, Volume 076. 177-184. .