Classification of topologies on finite sets using graphs
From MaRDI portal
Publication:3607366
DOI10.1007/S11253-008-0113-9zbMATH Open1164.05336OpenAlexW2086259609MaRDI QIDQ3607366FDOQ3607366
Authors: N. P. Adamenko, I. G. Velichko
Publication date: 28 February 2009
Published in: Ukrainian Mathematical Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11253-008-0113-9
Recommendations
Directed graphs (digraphs), tournaments (05C20) Planar graphs; geometric and topological aspects of graph theory (05C10) Lower separation axioms ((T_0)--(T_3), etc.) (54D10)
Cited In (7)
- Finite topological spaces and graphs
- Topologies on the \(n\)-element set consistent with topologies close to discrete on an \((n -1)\)-element set
- The listing of topologies close to the discrete one on finite sets
- Classification of \(k\)-nets
- On some formulas in the problem of enumeration of finite labeled topologies
- On recursion relations in the problem of enumeration of posets
- Finite topologies and digraphs
This page was built for publication: Classification of topologies on finite sets using graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3607366)