pith. machine review for the scientific record.
sign in

arxiv: 1206.0550 · v1 · pith:SBKGMDE4new · submitted 2012-06-04 · 🧮 math.CO · math.GN

Enumerations of finite topologies associated with a finite graph

classification 🧮 math.CO math.GN
keywords topologiesfinitegraphnon-homeomorphicarticleassociatedcompletecorrespondence
0
0 comments X
read the original abstract

The number of topologies and non-homeomorphic topologies on a fixed finite set are now known up to $n=18$, $n=16$ but still no complete formula yet (Sloane). There are one to one correspondence among topologies, preorder and digraphs. In this article, we enumerate topologies and non-homeomorphic topologies whose underlying graph is a given finite graph.

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.