7 Any equivalent to the Four color theorem for non-planar graphs? 6 size of an independent set of any graph with $n$ vertices and maximum degree $d$ 6 Connection between chromatic number and independence number of a graph 5 Chromatic index of a complete graph 5 Proving a graph is connected by minimum degree

Reputation (2,622)

This user has no recent positive reputation changes

Questions (25)

 7 If $x * x = e$ for all $x$ and $(x_i * x_j) * (x_j*x_k) = x_i*x_k$, then $*$ is associative 4 For every pair of distinct primes $p_1$ and $p_2$, there are $z$ such that $p_1 + z$ is prime but $p_2 + z$ is not 4 Struggling with inequality involving a bunch of binomial coefficients 3 If $\mathbb{E}[X] = 0$, then $P[X \geq \lambda] \leq \frac{\sigma^2}{\sigma^2 + \lambda^2}$ 3 Definition of compatible vertices

Tags (59)

 142 graph-theory × 112 8 trees × 13 23 combinatorics × 19 6 np-complete × 4 14 discrete-mathematics × 17 5 computer-science × 6 14 coloring × 5 4 proof-verification × 5 12 algorithms × 11 4 proof-writing × 2

Accounts (15)

 Mathematics 2,622 rep 716 Computer Science 325 rep 19 Theoretical Computer Science 207 rep 16 MathOverflow 205 rep 16 Quantitative Finance 139 rep 4