| | |
| | |
Stat |
Members: 3645 Articles: 2'504'928 Articles rated: 2609
26 April 2024 |
|
| | | |
|
Article overview
| |
|
Binomial Sum on Coefficients of Chromatic Polynomials | Suijie Wang
; Yeong-Nan Yeh
; | Date: |
24 Sep 2012 | Abstract: | Let $chi_G(t)=a_0t^n-a_1t^{n-1}+... (-1)^ra_rt^{n-r}$ be the chromatic
polynomial of the graph $G$. For any $q,kin Bbb{Z}$ with $0le kle min{r,
q+r+1}$, we obtain that the binomial sum $sum_{i=0}^{k}{qchoose i}a_{k-i}$ of
$a_i$ is bounded above by ${m+qchoose k}$ and below by ${r+qchoose k}$, i.e.,
[{r+qchoose k}le sum_{i=0}^{k}{qchoose i}a_{k-i}le {m+qchoose k}.] | Source: | arXiv, 1209.5185 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
| News, job offers and information for researchers and scientists:
| |