1 citations · 1 across the 6 of their papers we have counts for
10 papers
Optimal redundancy of function-correcting codes
Gennian Ge, Zixiang Xu, Xiande Zhang +1
Function-correcting codes, introduced by Lenz, Bitar, Wachter-Zeh, and Yaakobi, protect specific function values of a message rather than the entire message. A central challenge is…
A generic framework for coded caching and distributed computation schemes
Min Xu, Zixiang Xu, Gennian Ge +1
Several network communication problems are highly related such as coded caching and distributed computation. The centralized coded caching focuses on reducing the network burden in…
A note on multicolor Ramsey number of small odd cycles versus a large clique
Zixiang Xu, Gennian Ge
Let be the smallest number such that every coloring of the edges of with colors has either a monochromatic in color for some $1\leqslant i\le…
On color isomorphic subdivisions
Zixiang Xu, Gennian Ge
Given a graph and an integer , let be the smallest number of colors such that there exists a proper edge-coloring of the complete graph w…
Color isomorphic even cycles and a related Ramsey problem
Zixiang Xu, Tao Zhang, Yifan Jing +1
In this paper, we first study a new extremal problem recently posed by Conlon and Tyomkyn~(arXiv: 2002.00921). Given a graph and an integer , let be…
On the Turán number of 1-subdivision of
Tao Zhang, Zixiang Xu, Gennian Ge
For a graph , the 1-subdivision of , denoted by , is the graph obtained by replacing the edges of by internally disjoint paths of length 2. Recently, Conlon, Janzer a…