Abstract
A finite To topology, or an acyclic transitive digraph, partitions its underlying point set uniquely into certain ordered subsets called chains, and the size of a chain is the number of points in it. This paper shows that if a To topology, or an acyclic transgraph, satisfies a prescribed condition then, for any. i, the number of chains with size i is set-reconstructible.
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.
