1,2,3-Conjecture and 1,2-Conjecture for Sparse Graphs
Combinatorics
2015-08-06 v2
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. Stronger results on these conjectures have been proved, but this is the first application of discharging to them, and the structure theorems and reducibility results are of independent interest.
Keywords
Cite
@article{arxiv.1303.3198,
title = {1,2,3-Conjecture and 1,2-Conjecture for Sparse Graphs},
author = {Daniel W. Cranston and Sogol Jahanbekam and Douglas B. West},
journal= {arXiv preprint arXiv:1303.3198},
year = {2015}
}
Comments
29 pages, 19 figures; same results as earlier version, but revised introduction