(1,k)-Choosability of Graphs with Edge Lists Containing Arithmetic Progressions

Author/​Artist
Tao, Andrew [Browse]
Format
Senior thesis
Language
English

Availability

Available Online

Details

Advisor(s)
Liu, Chun-Hung [Browse]
Contributor(s)
Chudnovsky, Maria [Browse]
Department
Princeton University. Department of Mathematics [Browse]
Class year
2017
Summary note
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.
Statement on language in description
Princeton University Library aims to describe library materials in a manner that is respectful to the individuals and communities who create, use, and are represented in the collections we manage. Read more...

Supplementary Information