Chengfei Xie

collaborators

3 papers

math.CO2021

On the minimal degree condition of graphs implying some properties of subgraphs

Bingchen Qian, Chengfei Xie, Gennian Ge

Erdős posed the problem of finding conditions on a graph $G$ that imply the largest number of edges in a triangle-free subgraph is equal to the largest number of edges in a biparti…

math.CO2021

Some Results on $k$ -Turán-good Graphs

Bingchen Qian, Chengfei Xie, Gennian Ge

For a graph $H$ and a $k$ -chromatic graph $F,$ if the Turán graph $T_{k - 1} (n)$ has the maximum number of copies of $H$ among all $n$ -vertex $F$ -free graphs (for $n$ large enough),…

math.CO2020

On the size of Nikodym sets in spaces over rings

Chengfei Xie, Gennian Ge

A Nikodym set $N \subseteq (Z / (N Z))^{n}$ is a set containing $L ∖ {x}$ for every $x \in (Z / (N Z))^{n}$ , where $L$ is a line passing thr…

On the minimal degree condition of graphs implying some properties of subgraphs

Some Results on k-Turán-good Graphs

On the size of Nikodym sets in spaces over rings

Some Results on $k$ -Turán-good Graphs