Minimum multiplicities of subgraphs and Hamiltonian systems
Combinatorics
2007-05-23 v1
Abstract
Let G be a finite simple graph with automorphism group A(G). Then a spanning subgraph U of G is a fixing subgraph of G if G contains exactly subgraphs isomorphic to U: the graph G must always contain at least this number. If in addition then U is a strong fixing subgraph. Fixing subgraphs are important in many areas of graph theory. We consider them in the context of Hamiltonian graphs
Cite
@article{arxiv.math/0012258,
title = {Minimum multiplicities of subgraphs and Hamiltonian systems},
author = {John Sheehan},
journal= {arXiv preprint arXiv:math/0012258},
year = {2007}
}
Comments
to appear in Discrete Math