activity
20202026
collaborators
Showing math.COShow all

6 papers · 1 filter

math.CO2025

Dot-product graphs in finite fields

Chengfei Xie, Gennian Ge

In this paper, we study the dot-product graphs in . We prove that if the size of the product of two adjacent sets is large enough, then the set of dot-product graph…

math.CO2023

Some results on similar configurations in subsets of

Chengfei Xie, Gennian Ge

In this paper, we study problems about the similar configurations in . Let be a graph, where and . For a s…

math.CO2021

Some sum-product estimates in matrix rings over finite fields

Chengfei Xie, Gennian Ge

We study some sum-product problems over matrix rings. Firstly, for , we have whenever $|A||B||C|\gtrsim q^{3n^2-\fr…

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 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 -Turán-good Graphs

Bingchen Qian, Chengfei Xie, Gennian Ge

For a graph and a -chromatic graph if the Turán graph has the maximum number of copies of among all -vertex -free graphs (for large enough),…

math.CO2020

On the size of Nikodym sets in spaces over rings

Chengfei Xie, Gennian Ge

A Nikodym set is a set containing for every , where is a line passing thr…