The reviewed record of science sign in
Pith

arxiv: math/0012258 · v1 · pith:VFYWQVMJ · submitted 2000-12-28 · math.CO

Minimum multiplicities of subgraphs and Hamiltonian systems

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:VFYWQVMJrecord.jsonopen to challenge →

classification math.CO
keywords fixinggraphsubgraphsubgraphshamiltonianthenadditionalways
0
0 comments X
read the original 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 $| A(G)|/ | A(G) \cap A(U)| $ subgraphs isomorphic to U: the graph G must always contain at least this number. If in addition $A(U) \subseteq A(G)$ 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

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.