n-Arc Connected Spaces
classification
🧮 math.GN
keywords
graphsn-acconnectedfamilyn-arcalephcharacterizationcharacterized
read the original abstract
A space is `n-arc connected' (n-ac) if any family of no more than n-points are contained in an arc. For graphs the following are equivalent: (i) 7-ac, (ii) n-ac for all n, (iii) continuous injective image of a closed sub-interval of the real line, and (iv) one of a finite family of graphs. General continua that are aleph_0-ac are characterized. The complexity of characterizing n-ac graphs for n=2,3,4,5 is determined to be strictly higher than that of the stated characterization of 7-ac graphs.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.