Abstract
A reduced map is a continuous function such that the preimage of every proper subcontinuum of the range is disconnected. A k -to-1 cut set is a finite subset B of a continuum X such that X\\B has at least k|B| components. If a continuum is the image of a reduced at most k -to-1 map from a continuum, then it does not contain a k -to-1 cut set. A connected graph is the image of a reduced at most k -to-1 map from a continuum if and only if the graph does not contain a k -to-1 cut set. A connected graph is the image of a reduced k -to-1 map from a continuum if and only if the graph does not contain a k -to-1 cut set or an endpoint.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
