A Shorter Proof of the Transitivity of Transfinite Connectedness
| dc.creator | Zemanian, A. H. | |
| dc.date | 2003-03-27 | |
| dc.date.accessioned | 2026-07-07T04:56:27Z | |
| dc.date.available | 2026-07-07T04:56:27Z | |
| dc.description | A criterion is established for the transitivity of connectedness in a transfinite graph. Its proof is much shorter than a prior argument published previously for that criterion. | |
| dc.description | 6 pages | |
| dc.identifier | https://arxiv.org/abs/math/0303358 | |
| dc.identifier | http://arxiv.org/abs/math/0303358 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/66927 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C99 | |
| dc.title | A Shorter Proof of the Transitivity of Transfinite Connectedness | |
| dc.type | text |