G. Ge

activity

20082023

most citedPrivate Information Retrieval from MDS Coded Databases with Colluding Servers under Several Variant Models

35 citations · 285 across the 85 of their papers we have counts for

collaborators

Showing 2019 · math.COShow all

5 papers · 2 filters

math.CO2019★ 1 cited

Bollobás type theorems for hemi-bundled two families

Wenjun Yu, Xiangliang Kong, Yuanxiao Xi +2

Let ${(A_{i}, B_{i})}_{i = 1}^{m}$ be a collection of pairs of sets with $∣ A_{i} ∣ = a$ and $∣ B_{i} ∣ = b$ for $1 \leq i \leq m$ . Suppose that $A_{i} \cap B_{j} = \emptyset$ if and only if $i = j$ , then by…

math.CO2019★ 1 cited

3-uniform hypergraphs with few Berge paths of length three between any two vertices

Tao Zhang, Zixiang Xu, Gennian Ge

Recently, Berge theta hypergraphs have received special attention due to the similarity with Berge even cycles. Let $r$ -uniform Berge theta hypergraph $Θ_{ℓ, t}^{B}$ be the $r$ -u…

math.CO2019★ 6 cited

Some tight lower bounds for Turán problems via constructions of multi-hypergraphs

Zixiang Xu, Tao Zhang, Gennian Ge

Recently, several hypergraph Turán problems were solved by the powerful random algebraic method. However, the random algebraic method usually requires some parameters to be very la…

math.CO2019★ 2 cited

Some extremal results on hypergraph Turán problems

Zixiang Xu, Tao Zhang, Gennian Ge

For two $r$ -graphs $T$ and $H$ , let $ex_{r} (n, T, H)$ be the maximum number of copies of $T$ in an $n$ -vertex $H$ -f…

math.CO2019★ 3 cited

Some extremal results on K_{s,t}-free graphs

Tao Zhang, Gennian Ge

For graphs $H$ and $F$ , let $ex (n, H, F)$ be the maximum possible number of copies of $H$ in an $F$ -free graph on $n$ vertices. The study of this function, which generalizes t…