On a conjecture concerning vertex-transitive graphs
Combinatorics
2009-05-18 v2
Abstract
In this article we define a minor relation, which is stronger than the classical one, but too strong to become a well-quasi-order on the class of finite graphs. Nevertheless, with this terminology we are able to introduce a conjecture, which would imply the Lovasz conjecture and give an interesting insight on the symmetry of vertex-transitive graphs, if true. Though it could become an approach to solve the Lovasz conjecture. These ideas were first introduced by the author in his Diploma Thesis.
Cite
@article{arxiv.0905.2420,
title = {On a conjecture concerning vertex-transitive graphs},
author = {Tobias Ahsendorf},
journal= {arXiv preprint arXiv:0905.2420},
year = {2009}
}
Comments
5 pages, corrected typos