Name
Abstract | ||
|---|---|---|
A tolerance is a reflexive and symmetric, but not necessarily transitive, binary relation. Contrary to what happens with equivalence relations, when dealing with tolerances one must distinguish between blocks (maximal subsets where the tolerance is a total relation) and classes (the class of an element is the set of those elements tolerable with it). Both blocks and classes of a tolerance on a set define coverings of this set, but not every covering of a set is defined in this way. The characterization of those coverings that are families of blocks of some tolerance has been known for more than a decade now. In this paper we give a characterization of those coverings of a finite set that are families of classes of some tolerance. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1016/j.ins.2003.12.002 | Inf. Sci. |
Keywords | Field | DocType |
equivalence relation,similarity relation,neighborhood,tolerance,block,class,tolerance class,finite set,total relation,binary relation,maximal subsets | Discrete mathematics,Equivalence relation,Combinatorics,Finite set,Binary relation,Similarity relation,Total relation,Mathematics,Transitive relation | Journal |
Volume | Issue | ISSN |
166 | 1-4 | 0020-0255 |
Citations | PageRank | References |
36 | 1.62 | 5 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| W. Bartol | 1 | 36 | 2.30 |
| J. Miró | 2 | 36 | 1.62 |
| Konrad Pióro | 3 | 36 | 3.31 |
| F. Rosselló | 4 | 51 | 4.00 |