On a conjecture concerning vertex-transitive graphs
| dc.creator | Ahsendorf, Tobias | |
| dc.date | 2009-05-14 | |
| dc.date | 2009-05-18 | |
| dc.date.accessioned | 2026-07-07T13:15:32Z | |
| dc.date.available | 2026-07-07T13:15:32Z | |
| dc.description | 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. | |
| dc.description | 5 pages, corrected typos | |
| dc.identifier | https://arxiv.org/abs/0905.2420 | |
| dc.identifier | http://arxiv.org/abs/0905.2420 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/230498 | |
| dc.subject | Combinatorics | |
| dc.title | On a conjecture concerning vertex-transitive graphs | |
| dc.type | text |