"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

MIGHTY LIII (Midwest Graph Theory Conference) (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 22, 2012

Location

Ames, IA

Citation Information

Sogol Jahanbekam. "1,2,3-conjecture and 1,2-conjecture for sparse graphs" MIGHTY LIII (Midwest Graph Theory Conference) (2012)
Available at: http://works.bepress.com/sogol-jahanbekam/38/