Arnbjörg Soffía Árnadóttir, Waltraud Lederle, R. G. Möller
{"title":"无限三次顶点传递图及其在完全不连通局部紧群上的应用","authors":"Arnbjörg Soffía Árnadóttir, Waltraud Lederle, R. G. Möller","doi":"10.37236/10709","DOIUrl":null,"url":null,"abstract":"We study groups acting vertex-transitively and non-discretely on connected, cubic graphs (regular graphs of degree 3). Using ideas from Tutte's fundamental papers in 1947 and 1959, it is shown that if the action is edge-transitive, then the graph has to be a tree. When the action is not edge-transitive Tutte's ideas are still useful and can, amongst other things, be used to fully classify the possible two-ended graphs. Results about cubic graphs are then applied to Willis' scale function from the theory of totally disconnected, locally compact groups. Some of the results in this paper have most likely been known to experts but most of them are not stated explicitly with proofs in the literature.","PeriodicalId":11515,"journal":{"name":"Electronic Journal of Combinatorics","volume":"140 1","pages":""},"PeriodicalIF":0.7000,"publicationDate":"2022-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On Infinite, Cubic, Vertex-Transitive Graphs with Applications to Totally Disconnected, Locally Compact Groups\",\"authors\":\"Arnbjörg Soffía Árnadóttir, Waltraud Lederle, R. G. Möller\",\"doi\":\"10.37236/10709\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study groups acting vertex-transitively and non-discretely on connected, cubic graphs (regular graphs of degree 3). Using ideas from Tutte's fundamental papers in 1947 and 1959, it is shown that if the action is edge-transitive, then the graph has to be a tree. When the action is not edge-transitive Tutte's ideas are still useful and can, amongst other things, be used to fully classify the possible two-ended graphs. Results about cubic graphs are then applied to Willis' scale function from the theory of totally disconnected, locally compact groups. Some of the results in this paper have most likely been known to experts but most of them are not stated explicitly with proofs in the literature.\",\"PeriodicalId\":11515,\"journal\":{\"name\":\"Electronic Journal of Combinatorics\",\"volume\":\"140 1\",\"pages\":\"\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2022-12-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Electronic Journal of Combinatorics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.37236/10709\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronic Journal of Combinatorics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.37236/10709","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
On Infinite, Cubic, Vertex-Transitive Graphs with Applications to Totally Disconnected, Locally Compact Groups
We study groups acting vertex-transitively and non-discretely on connected, cubic graphs (regular graphs of degree 3). Using ideas from Tutte's fundamental papers in 1947 and 1959, it is shown that if the action is edge-transitive, then the graph has to be a tree. When the action is not edge-transitive Tutte's ideas are still useful and can, amongst other things, be used to fully classify the possible two-ended graphs. Results about cubic graphs are then applied to Willis' scale function from the theory of totally disconnected, locally compact groups. Some of the results in this paper have most likely been known to experts but most of them are not stated explicitly with proofs in the literature.
期刊介绍:
The Electronic Journal of Combinatorics (E-JC) is a fully-refereed electronic journal with very high standards, publishing papers of substantial content and interest in all branches of discrete mathematics, including combinatorics, graph theory, and algorithms for combinatorial problems.