English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

We consider the following list coloring with separation problem: Given agraph $G$ and integers $a,b$, find the largest integer $c$ such that for anylist assignment $L$ of $G$ with $|L(v)|= a$ for any vertex $v$ and $|L(u)\capL(v)|\le c$ for any edge $uv$ of $G$, there exists an assignment $\varphi$ ofsets of integers to the vertices of $G$ such that $\varphi(u)\subset L(u)$ and$|\varphi(v)|=b$ for any vertex $u$ and $\varphi(u)\cap \varphi(v)=\emptyset$for any edge $uv$. Such a value of $c$ is called the separation number of$(G,a,b)$. Using a special partition of a set of lists for which we obtain animproved version of Poincar\'e's crible, we determine the separation number ofthe complete graph $K_n$ for some values of $a,b$ and $n$, and prove bounds forthe remaining values.

On List Coloring with Separation of the Complete Graph and Set System Intersections