2009/05/14 by Tobias Ahsendorf, Ahsendorf, Tobias
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #Limits and Structures in Graph Theory
paper · pdf · doi:10.48550/arxiv.0905.2420
openalex publication_date 2009/05/14 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.