Vankov V.

The ACS campus problem

The ACS campus problem is a graph theory problem that deals with the necessary and sufficient conditions for the existence of Euler paths and cycles in undirected connected graph structures. The idea behind it was born as a result of the combination between my passion for combinatorics and strolls in green areas as well as the key thought "how to walk less and see more." The project introduces three constructions (the ACS campus, Sofia Tech Park, and the bridges in Königsberg) which illustrate all cases of graphs that may or may not have Euler paths or cycles, and then examines the conditions that guarantee the existence of such trails. After a detailed analysis of all statements and proofs, the presentation concludes with a list of applications in problems and in practice. The entire Science Fair project, including the information and the diagrams, is compiled in a Google Slides presentation and a Google Sites webpage. In my opinion, "The ACS Campus Problem" may prove to be beneficial for virtually anybody since it reveals the math behind efficient routes and highlights the essence of the knowledge about Euler’s theorem in everyday life.