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/

Global: Zendy Plus annual

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

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We consider the Tur\'an problems of $2$-edge-colored graphs. A$2$-edge-colored graph $H=(V, E_r, E_b)$ is a triple consisting of the vertexset $V$, the set of red edges $E_r$ and the set of blue edges $E_b$ with $E_r$and $E_b$ do not have to be disjoint. The Tur\'an density $\pi(H)$ of $H$ isdefined to be $\lim_{n\to\infty} \max_{G_n}h_n(G_n)$, where $G_n$ is chosenamong all possible $2$-edge-colored graphs on $n$ vertices containing no $H$ asa sub-graph and $h_n(G_n)=(|E_r(G)|+|E_b(G)|)/{n\choose 2}$ is the formula tomeasure the edge density of $G_n$. We will determine the Tur\'an densities ofall $2$-edge-colored bipartite graphs. We also give an important application ofour study on the Tur\'an problems of $\{2, 3\}$-hypergraphs.

Tur\'an Density of $2$-edge-colored Bipartite Graphs with Application on $\{2, 3\}$-Hypergraphs