Article
Licensed
Unlicensed
Requires Authentication
Symmetric linear spaces of graphs
Published/Copyright:
July 15, 2011
Abstract
We consider sets of graphs which are closed under the symmetric difference and renaming of vertices. We prove that for any n there are at most 14 such sets consisting of graphs with n vertices.
Received: 2008-10-15
Published Online: 2011-07-15
Published in Print: 2011-July
© de Gruyter 2011
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Prohibitions in discrete probabilistic statistical problems
- An asynchronous double stochastic flow with initiation of superfluous events
- Asymptotic expansions for the distribution of the number of components in random mappings and partitions
- Symmetric linear spaces of graphs
- On automorphisms of commutative Moufang loops
- On the mixing properties of operations in a finite field
- The predicate method to construct the Post lattice
- Average complexity of searching for identical objects in random nonuniform databases
- On construction of efficient algorithms for solving systems of polynomial Boolean equations by testing a part of variables
Articles in the same Issue
- Prohibitions in discrete probabilistic statistical problems
- An asynchronous double stochastic flow with initiation of superfluous events
- Asymptotic expansions for the distribution of the number of components in random mappings and partitions
- Symmetric linear spaces of graphs
- On automorphisms of commutative Moufang loops
- On the mixing properties of operations in a finite field
- The predicate method to construct the Post lattice
- Average complexity of searching for identical objects in random nonuniform databases
- On construction of efficient algorithms for solving systems of polynomial Boolean equations by testing a part of variables
