Open Problem Garden

Author(s): Noel

Conjecture If $G$ is a $k$ -chromatic graph on at most $mk$ vertices, then $\text{ch}(G)\leq \text{ch}(K_{m*k})$ .

Keywords: choosability; complete multipartite graph; list coloring

Posted by Jon Noel
updated February 2nd, 2013

add new comment

Atserias, Albert

Analysis

Inequality for square summable complex series ★★

Author(s): Retkes

Conjecture For all $\alpha=(\alpha_1,\alpha_2,\ldots)\in l_2(\cal{C})$ the following inequality holds $\sum_{n\geq 1}|\alpha_n|^2\geq \frac{6}{\pi^2}\sum_{k\geq0}\bigg| \sum_{l\geq0}\frac{1}{l+1}\alpha_{2^k(2l+1)}\bigg|^2$

Keywords: Inequality

Posted by tigris35711
updated October 29th, 2014

2 comments

Open Problem Garden

graph colourings

Same day loans,Instant Loans

JUSTIN ABRAHAM

INFINITY

ZERO

24 hour loans for unemployed, loans for unemployed

24 hour loans for unemployed, loans for unemployed

Choice Number of k-Chromatic Graphs of Bounded Order ★★

Atserias, Albert

Inequality for square summable complex series ★★

Navigate

Recent Activity