We call a finite, simple, undirected graph $G=(V,E)$ an $n$-*Erdos graph* if there are $n$ subsets $S_1,\ldots, S_n$ of $V$ such that

- $V = \bigcup_{n=1}^n S_n$;
- each $S_k$ has $n$ elements for $k\in\{1,\ldots, n\}$;
- $\{a,b\}\in E$ implies that there is $k\in\{1,\ldots,n\}$ such that $a, b\in S_k$;
- $k\neq j\in \{1,\ldots, n\}$ imply $|S_k\cap S_j|\leq 1$.

One version of the Erdos-Faber-Lovasz conjecture says that if $G$ is an $n$-Erdos graph, then $\chi(G) \leq n$.

We say that $G$ is a *weak* $n$-*Erdos graph* if items 1.-3. above are satisfied, but not necessarily number 4.

Is there $k\in \mathbb{R}$ with $k>1$ such that for all $n\in \mathbb{N}$ we have that if $G$ is a weak $n$-Erdos graph, then $\chi(G) \leq k\cdot n$? If yes, what is the smallest such $k$?

(Note: for $n=3$ it is possible to find a weak $n$-Erdos graph $G$ with $\chi(G) = 4$, maybe I add the example later on. So if such a $k$ exists we have $k\geq 4/3$.)