Alison Charlesworth

Easy as 1-2-3: The 1-2-3 Conjecture for Polygonal Tilings
Overview

This event is in the past.

Event details
Export this event in ICS format
Start
End
Types of event
Talk
Venue
Inselplatz 5, SR 1006
07743 Jena
Google Maps site planExternal link
Language of the event
English
Barrier-free access
No
Public
No

Abstract

The 1-2-3 conjecture states that for every finite, connected graph with at least three vertices, edges can be assigned a weight of 1, 2, or 3 such that the sum of the weights at each vertex is distinct from all neighbouring vertices. In this talk we will explore solutions to the 1-2-3 problem on infinite polygonal tilings. The goal is to find finite patterns that when repeated solve the infinite problem.