No abstract uploaded!

Let $f(n)$ be the maximum number of edges in a graph on $n$ vertices in which no two cycles have the same length. Erd\"{o}s raised the problem of determining $f(n)$. Erd\"{o}s conjectured that there exists a positive constant $c$ such that $ex(n,C_{2k})\geq cn^{1+1/k}$. Haj\'{o}s conjecture that every simple even graph on $n$ vertices can be decomposed into at most $n/2$ cycles. We present the problems, conjectures related to these problems and we summarize the know results. We do not think Haj\'{o}s conjecture is true.

We give a detailed proof of Siu’s theorem on extendibility of holomorphic vector bundles of rank larger than one, and prove a corresponding extension theorem for holomorphic sprays. We apply this result to study ellipticity properties of complements of compact subsets in Stein manifolds. In particular we show that the complement of a closed ball in $\mathbb{C}^{n}, n \geq3$ , is not subelliptic.

No abstract uploaded!

No abstract uploaded!