Talks concerning the study of embeddings of graphs in the 3-dimensional space or surfaces and graphs as topological spaces. Organizers: Thomas Mattman and Andrei Pavelescu.
Topological graph theory studies how graphs can be embedded in the 3-dimensional space and on surfaces, focusing on the relationships between graph properties and the topology of the surfaces in which they are embedded.
Organizers: Thomas Mattman and Andrei Pavelescu
Suppose you have a subset
View Submission
We say that a simplicial
View Submission
A
View Submission
Decomposing the complete graph into arbitrary graph is a challenging and di cult problem in graph theory. In in this paper, we prove that the complete graph K4m+1 can be decomposed into 4m + 1 copies of an arbitrary tree with m edges and m copies of a Hamiltonian cycle whenever 4m+1 is a prime.
View Submission
Determining how to build a minimal genus embedding of a graph is a classical and frequently challenging problem in topological graph theory. Here, we will be interested in Cartesian products of graphs where their fiber structures and symmetries can sometimes be leveraged to efficiently build embeddings and determine the genera of such graphs. More specifically, we will discuss work done towards a classification of all Cartesian products of graphs that embed on the torus where we leverage basic tools from combinatorial topology and determine the genera of certain graphs along the way. This work was part of an undergraduate summer research project with Beppy Badgett, and time permitting, we will briefly discuss ideas for future projects in this area that only requires some background in undergraduate graph theory and surface topology to get started.
View Submission
An
View Submission
A simplicial complex is said to be critical (or forbidden) for the 3-sphere
View Submission
Let
View Submission
The Graph Minor Theorem of Robertson and Seymour implies a finite set of obstructions for any minor closed graph property. We show that there are only three obstructions to knotless embedding of size 23, which is far fewer than the 92 of size 22 and the hundreds known to exist at larger sizes. We describe several other topological properties whose obstruction set demonstrates a similar dip at small size. For order ten graphs, we classify the 35 obstructions to knotless embedding and the 49 maximal knotless graphs. This work is collaborated with Thomas Mattman.
View Submission
For any d > 0, define
View Submission
A handcuff graph is a graph consisting of disjoint two loops and connected by an edge. The lattice stick number of a handcuff graph is the minimum number of sticks required to embed the graph in a lattice space. Previous studies have shown that the lattice stick numbers of the trivial handcuff graph and the Hopf-linked handcuff graph are 9 and 11, respectively, and these are the only graphs whose lattice stick number is 13 or less. In this talk, we utilize a squeezing method to identify all models with a lattice stick number of at most 14.
View Submission
View Submission
In joint work with Louis Kauffman and Susan Williams, we give an elementary introduction to the Penrose polynomial for cubic graphs and explore the combinatorial significance of its coefficients. No special background is assumed.
View Submission
Since Kauffman first introduced the concept of ribbonlength for knots and links, many researchers, including Denne, have studied ribbonlength using folded ribbons. In several studies, upper bounds for ribbonlength were obtained by folding the ribbon in the shape of a right isosceles triangle. In this presentation, we introduce a new method of folding the ribbon into an equilateral triangle shape instead of the right isosceles triangle. We will then relate this method to three-page presentations, which are variations of the arc presentation. In this process, we present new upper bounds for the ribbonlength of the Hopf link and the trefoil knot.
View Submission
The intrinsic properties of carbon nanosheets derived from their basic molecular structure through a self-similar pattern have attracted much interest among researchers. Graph-theoretical methods are used to identify certain molecular descriptors known as topological indices, which are highly useful in connecting molecules to their physical attributes. Several chemical characteristics have been correlated with degree and neighborhood degree sum-based topological indices, which have been investigated extensively. Our current research establishes the use of topological indices in studying the newly synthesized carbon allotropes
View Submission
In 1930, Ramsey proved that for every positive integer
View Submission