### Abstract

A subset U of a set S with a binary operation is called avoidable if S can be partitioned into two subsets A and B such that no element of U can be written as a product of two distinct elements of A or as the product of two distinct elements of B. The avoidable sets of the bicyclic inverse semigroup are classified.

Original language | English (US) |
---|---|

Pages (from-to) | 273-288 |

Number of pages | 16 |

Journal | Ars Combinatoria |

Volume | 77 |

State | Published - Oct 2005 |

### Fingerprint

### Keywords

- Additive partition
- Avoidable set
- Bicyclic inverse semigroup
- Bipartite graph

### ASJC Scopus subject areas

- Mathematics(all)

### Cite this

**Avoidable sets in the bicyclic inverse semigroup.** / Sieben, Nandor.

Research output: Contribution to journal › Article

*Ars Combinatoria*, vol. 77, pp. 273-288.

}

TY - JOUR

T1 - Avoidable sets in the bicyclic inverse semigroup

AU - Sieben, Nandor

PY - 2005/10

Y1 - 2005/10

N2 - A subset U of a set S with a binary operation is called avoidable if S can be partitioned into two subsets A and B such that no element of U can be written as a product of two distinct elements of A or as the product of two distinct elements of B. The avoidable sets of the bicyclic inverse semigroup are classified.

AB - A subset U of a set S with a binary operation is called avoidable if S can be partitioned into two subsets A and B such that no element of U can be written as a product of two distinct elements of A or as the product of two distinct elements of B. The avoidable sets of the bicyclic inverse semigroup are classified.

KW - Additive partition

KW - Avoidable set

KW - Bicyclic inverse semigroup

KW - Bipartite graph

UR - http://www.scopus.com/inward/record.url?scp=33644666766&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33644666766&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:33644666766

VL - 77

SP - 273

EP - 288

JO - Ars Combinatoria

JF - Ars Combinatoria

SN - 0381-7032

ER -