Please use this identifier to cite or link to this item:
|Title:||(1,k)-Choosability of Graphs with Edge Lists Containing Arithmetic Progressions|
|Abstract:||In this paper, we give a strengthening of the 1-2-3 conjecture by restricting all edge lists to be arithmetic progressions. We consider list assignments that take every vertex to a single integer and every edge to an arithmetic progression of integers. We prove that for every graph G with such a list assignment and edge lists have length at least 30(3^(2c(G))), then there exists a proper L-total weighting of G.|
|Type of Material:||Princeton University Senior Theses|
|Appears in Collections:||Mathematics, 1934-2017|
Files in This Item:
|Tao_Andrew_-_Thesis_Final_1.pdf||280.3 kB||Adobe PDF||Request a copy|
Items in Dataspace are protected by copyright, with all rights reserved, unless otherwise indicated.