New upper bounds on the chromatic number of a graph
| dc.creator | rabern, landon | |
| dc.date | 2006-06-25 | |
| dc.date.accessioned | 2026-07-07T07:17:40Z | |
| dc.date.available | 2026-07-07T07:17:40Z | |
| dc.description | We outline some ongoing work related to a conjecture of Reed \cite{reed97} on $ω$, $Δ$, and $χ$. We conjecture that the complement of a counterexample $G$ to Reed's conjecture has connectivity on the order of $\log(|G|)$. We prove that this holds for a family (parameterized by $ε> 0$) of relaxed bounds; the $ε= 0$ limit of which is Reed's upper bound. | |
| dc.identifier | https://arxiv.org/abs/math/0606632 | |
| dc.identifier | http://arxiv.org/abs/math/0606632 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/114023 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C15, 05C40, 05C69 | |
| dc.title | New upper bounds on the chromatic number of a graph | |
| dc.type | text |