"1,2,3-Conjecture and 1,2-Conjecture for sparse graphs" by Sogol Jahanbekam

Presentation

1,2,3-Conjecture and 1,2-Conjecture for sparse graphs

UIUC Women in Math Seminars (2012)

Sogol Jahanbekam, University of Illinois at Urbana-Champaign

Abstract

We apply the Discharging Method to prove the 1, 2, 3-Conjecture and the 1, 2-Conjecture for graphs with maximum average degree less than 8/3. As a result, the conjectures hold for planar graphs with girth at least 8.

Disciplines

Discrete Mathematics and Combinatorics

Publication Date

September 20, 2012

Location

Urbana, IL

Citation Information

Sogol Jahanbekam. "1,2,3-Conjecture and 1,2-Conjecture for sparse graphs" UIUC Women in Math Seminars (2012)
Available at: http://works.bepress.com/sogol-jahanbekam/42/