Loading...
Please wait, while we are loading the content...
Similar Documents
Discrete Ordered Sets whose Covering Graphs are Median
| Content Provider | Scilit |
|---|---|
| Author | Bandelt, Hans-J. |
| Copyright Year | 1984 |
| Description | As is well known the covering graph (= Hasse diagram) of any median semilattice is a median graph, and every median graph is the covering graph of some median semilattice. The purpose of this note is to prove that an ordered set is a median semilattice whenever (i) no interval contains an infinite chain, (ii) each pair of elements is bounded below, and (iii) the covering graph is median. |
| Related Links | http://www.ams.org/proc/1984-91-01/S0002-9939-1984-0735552-6/S0002-9939-1984-0735552-6.pdf |
| Ending Page | 8 |
| Page Count | 3 |
| Starting Page | 6 |
| ISSN | 00029939 |
| e-ISSN | 10886826 |
| DOI | 10.2307/2045257 |
| Journal | Proceedings of the American Mathematical Society |
| Issue Number | 1 |
| Volume Number | 91 |
| Language | English |
| Publisher | Duke University Press |
| Access Restriction | Open |
| Subject Keyword | Logic Covering Graphs Median Discrete Ordered Sets |
| Content Type | Text |
| Resource Type | Article |
| Subject | Applied Mathematics |