the census of edge- transitive tetravalent...
TRANSCRIPT
![Page 1: The Census of Edge- Transitive Tetravalent Graphshomepages.ulb.ac.be/~dleemans/SCDO2016/SCDO-TALKS/Thursday/Wilson.pdfSYMMETRY: A , also called an automorphism, of a graph is a permutation](https://reader033.vdocuments.site/reader033/viewer/2022060819/6098853ba96a4d46d65f9a56/html5/thumbnails/1.jpg)
SCDO, Queenstown, MiGawdItsBeautiful,
New Zealand
18 February, 2016
The Census of Edge-Transitive Tetravalent Graphs!
![Page 2: The Census of Edge- Transitive Tetravalent Graphshomepages.ulb.ac.be/~dleemans/SCDO2016/SCDO-TALKS/Thursday/Wilson.pdfSYMMETRY: A , also called an automorphism, of a graph is a permutation](https://reader033.vdocuments.site/reader033/viewer/2022060819/6098853ba96a4d46d65f9a56/html5/thumbnails/2.jpg)
The Site!
http://jan.ucc.nau.edu/~swilson/C4FullSite/index.html
http://jan.ucc.nau.edu/~swilson/C4FullSite/index.html
![Page 3: The Census of Edge- Transitive Tetravalent Graphshomepages.ulb.ac.be/~dleemans/SCDO2016/SCDO-TALKS/Thursday/Wilson.pdfSYMMETRY: A , also called an automorphism, of a graph is a permutation](https://reader033.vdocuments.site/reader033/viewer/2022060819/6098853ba96a4d46d65f9a56/html5/thumbnails/3.jpg)
Home Page!
![Page 4: The Census of Edge- Transitive Tetravalent Graphshomepages.ulb.ac.be/~dleemans/SCDO2016/SCDO-TALKS/Thursday/Wilson.pdfSYMMETRY: A , also called an automorphism, of a graph is a permutation](https://reader033.vdocuments.site/reader033/viewer/2022060819/6098853ba96a4d46d65f9a56/html5/thumbnails/4.jpg)
The Table!
![Page 5: The Census of Edge- Transitive Tetravalent Graphshomepages.ulb.ac.be/~dleemans/SCDO2016/SCDO-TALKS/Thursday/Wilson.pdfSYMMETRY: A , also called an automorphism, of a graph is a permutation](https://reader033.vdocuments.site/reader033/viewer/2022060819/6098853ba96a4d46d65f9a56/html5/thumbnails/5.jpg)
Home Page!
![Page 6: The Census of Edge- Transitive Tetravalent Graphshomepages.ulb.ac.be/~dleemans/SCDO2016/SCDO-TALKS/Thursday/Wilson.pdfSYMMETRY: A , also called an automorphism, of a graph is a permutation](https://reader033.vdocuments.site/reader033/viewer/2022060819/6098853ba96a4d46d65f9a56/html5/thumbnails/6.jpg)
Summary page!
![Page 7: The Census of Edge- Transitive Tetravalent Graphshomepages.ulb.ac.be/~dleemans/SCDO2016/SCDO-TALKS/Thursday/Wilson.pdfSYMMETRY: A , also called an automorphism, of a graph is a permutation](https://reader033.vdocuments.site/reader033/viewer/2022060819/6098853ba96a4d46d65f9a56/html5/thumbnails/7.jpg)
The Graph !
![Page 8: The Census of Edge- Transitive Tetravalent Graphshomepages.ulb.ac.be/~dleemans/SCDO2016/SCDO-TALKS/Thursday/Wilson.pdfSYMMETRY: A , also called an automorphism, of a graph is a permutation](https://reader033.vdocuments.site/reader033/viewer/2022060819/6098853ba96a4d46d65f9a56/html5/thumbnails/8.jpg)
Summary page!
![Page 9: The Census of Edge- Transitive Tetravalent Graphshomepages.ulb.ac.be/~dleemans/SCDO2016/SCDO-TALKS/Thursday/Wilson.pdfSYMMETRY: A , also called an automorphism, of a graph is a permutation](https://reader033.vdocuments.site/reader033/viewer/2022060819/6098853ba96a4d46d65f9a56/html5/thumbnails/9.jpg)
Constructions!
![Page 10: The Census of Edge- Transitive Tetravalent Graphshomepages.ulb.ac.be/~dleemans/SCDO2016/SCDO-TALKS/Thursday/Wilson.pdfSYMMETRY: A , also called an automorphism, of a graph is a permutation](https://reader033.vdocuments.site/reader033/viewer/2022060819/6098853ba96a4d46d65f9a56/html5/thumbnails/10.jpg)
Diagrams!
![Page 11: The Census of Edge- Transitive Tetravalent Graphshomepages.ulb.ac.be/~dleemans/SCDO2016/SCDO-TALKS/Thursday/Wilson.pdfSYMMETRY: A , also called an automorphism, of a graph is a permutation](https://reader033.vdocuments.site/reader033/viewer/2022060819/6098853ba96a4d46d65f9a56/html5/thumbnails/11.jpg)
Summary page!
+
![Page 12: The Census of Edge- Transitive Tetravalent Graphshomepages.ulb.ac.be/~dleemans/SCDO2016/SCDO-TALKS/Thursday/Wilson.pdfSYMMETRY: A , also called an automorphism, of a graph is a permutation](https://reader033.vdocuments.site/reader033/viewer/2022060819/6098853ba96a4d46d65f9a56/html5/thumbnails/12.jpg)
Covers Down!
![Page 13: The Census of Edge- Transitive Tetravalent Graphshomepages.ulb.ac.be/~dleemans/SCDO2016/SCDO-TALKS/Thursday/Wilson.pdfSYMMETRY: A , also called an automorphism, of a graph is a permutation](https://reader033.vdocuments.site/reader033/viewer/2022060819/6098853ba96a4d46d65f9a56/html5/thumbnails/13.jpg)
Covers Up!
![Page 14: The Census of Edge- Transitive Tetravalent Graphshomepages.ulb.ac.be/~dleemans/SCDO2016/SCDO-TALKS/Thursday/Wilson.pdfSYMMETRY: A , also called an automorphism, of a graph is a permutation](https://reader033.vdocuments.site/reader033/viewer/2022060819/6098853ba96a4d46d65f9a56/html5/thumbnails/14.jpg)
Aut-Orbitals!
![Page 15: The Census of Edge- Transitive Tetravalent Graphshomepages.ulb.ac.be/~dleemans/SCDO2016/SCDO-TALKS/Thursday/Wilson.pdfSYMMETRY: A , also called an automorphism, of a graph is a permutation](https://reader033.vdocuments.site/reader033/viewer/2022060819/6098853ba96a4d46d65f9a56/html5/thumbnails/15.jpg)
Glossary!
![Page 16: The Census of Edge- Transitive Tetravalent Graphshomepages.ulb.ac.be/~dleemans/SCDO2016/SCDO-TALKS/Thursday/Wilson.pdfSYMMETRY: A , also called an automorphism, of a graph is a permutation](https://reader033.vdocuments.site/reader033/viewer/2022060819/6098853ba96a4d46d65f9a56/html5/thumbnails/16.jpg)
Summary page!
![Page 17: The Census of Edge- Transitive Tetravalent Graphshomepages.ulb.ac.be/~dleemans/SCDO2016/SCDO-TALKS/Thursday/Wilson.pdfSYMMETRY: A , also called an automorphism, of a graph is a permutation](https://reader033.vdocuments.site/reader033/viewer/2022060819/6098853ba96a4d46d65f9a56/html5/thumbnails/17.jpg)
Propellor!
![Page 18: The Census of Edge- Transitive Tetravalent Graphshomepages.ulb.ac.be/~dleemans/SCDO2016/SCDO-TALKS/Thursday/Wilson.pdfSYMMETRY: A , also called an automorphism, of a graph is a permutation](https://reader033.vdocuments.site/reader033/viewer/2022060819/6098853ba96a4d46d65f9a56/html5/thumbnails/18.jpg)
Families Page!
![Page 19: The Census of Edge- Transitive Tetravalent Graphshomepages.ulb.ac.be/~dleemans/SCDO2016/SCDO-TALKS/Thursday/Wilson.pdfSYMMETRY: A , also called an automorphism, of a graph is a permutation](https://reader033.vdocuments.site/reader033/viewer/2022060819/6098853ba96a4d46d65f9a56/html5/thumbnails/19.jpg)
Families Page!
![Page 20: The Census of Edge- Transitive Tetravalent Graphshomepages.ulb.ac.be/~dleemans/SCDO2016/SCDO-TALKS/Thursday/Wilson.pdfSYMMETRY: A , also called an automorphism, of a graph is a permutation](https://reader033.vdocuments.site/reader033/viewer/2022060819/6098853ba96a4d46d65f9a56/html5/thumbnails/20.jpg)
The Recipes Paper!
"Recipes for Edge-Transitive !Tetravalent Graphs"!
Contains:!Recipes for all families of graphs! in the Census!Connections and overlaps between! Families!
Theorems and lesser results!
A dozen open problems!
![Page 21: The Census of Edge- Transitive Tetravalent Graphshomepages.ulb.ac.be/~dleemans/SCDO2016/SCDO-TALKS/Thursday/Wilson.pdfSYMMETRY: A , also called an automorphism, of a graph is a permutation](https://reader033.vdocuments.site/reader033/viewer/2022060819/6098853ba96a4d46d65f9a56/html5/thumbnails/21.jpg)
Other Page!