Finite topologies and Hamiltonian paths

DOI10.1016/S0095-8956(73)80008-5zbMath0249.54002OpenAlexW2043509698MaRDI QIDQ2556692

B. A. Anderson

Publication date: 1973

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0095-8956(73)80008-5

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Several topologies on one set (change of topology, comparison of topologies, lattices of topologies) (54A10)

Related Items (29)

Structured Codes of Graphs ⋮ Mutually complementary partial orders ⋮ Flat extensions of abstract polytopes ⋮ Partial order complementation graphs ⋮ Perfect 1-Factorizations of a Family of Cayley Graphs ⋮ Pairwise compatible Hamilton decompositions of \(K_n\) ⋮ Symmetry groups related to the construction of perfect one factorizations of \(K_{2n}\) ⋮ The number of complements of a topology on \(n\) points is at least \(2^ n\) (except for some special cases) ⋮ Complementation in the lattice of equivalence relations ⋮ Covering 2-paths uniformly ⋮ Perfect one-factorizations arising from the Lee metric ⋮ There are 3155 nonisomorphic perfect one‐factorizations of K₁₆ ⋮ Unifying some known infinite families of combinatorial 3-designs ⋮ Maximal pairwise complementary families of quasi-uniformities ⋮ Systems of pairs of cyclic type ⋮ On perfect one-factorization of the complete graph \(K_{2p}\) ⋮ Self complementary topologies and preorders ⋮ Unnamed Item ⋮ Semi-perfect 1-factorizations of the hypercube ⋮ Symmetry groups of some perfect 1-factorizations of complete graphs ⋮ Symmetry groups of some perfect 1-factorizations of complete graphs ⋮ On the number of 1-factorizations of the complete graph ⋮ A theorem on the maximum number of disjoint Steiner triple systems ⋮ On the existence of automorphism free Steiner triple systems ⋮ Steiner quadruple systems all of whose derived Steiner triple systems are nonisomorphic ⋮ A recursive construction of asymmetric 1-factorizations ⋮ The structure of the symmetry groups of perfect 1-factorizations of \(K_ 2n\) ⋮ A quantitative approach to perfect one-factorizations of complete bipartite graphs ⋮ The number of complements in the lattice of topologies on a fixed set

Cites Work

• Unnamed Item
• T 1 -Complements of T 1 Topologies
• A class of topologies with $T_1$-complements
• Families of Mutually Complementary Topologies

This page was built for publication: Finite topologies and Hamiltonian paths