3 problems

Let $G$ be a graph with minimum degree $\delta=\delta(G)$ and maximum degree $\Delta=\Delta(G)$, where $\delta eq 2$. The unrestricted upper-bound conjecture states that … The authors r…

Let $K_{s,t}$ be the complete bipartite graph with part sizes $s$ and $t$, where $s\leq t$, and let $C_k(G)$ denote the $k$-coalition number of a graph $G$. Complete bipartite grap…

Complete binary tree conjecture.