Chuandong Xu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Chuandong Xu has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Shenggui Zhang
School of Mathematics and Statistics, Northwestern Polytechnical University, Xi’an, P. R. China
4 shared publications - Bi Li
School of Mathematics and Statistics Xidian University 710071 Xi'an China
3 shared publications - Xin Zhang
Department of Finance and Risk Engineering, New York University, New York, NY 11201 USA
3 shared publications - Xuqing Bai
School of Mathematics and Statistics Xidian University 710071 Xi'an China
3 shared publications - Hongna Yang
Northwestern Polytech Univ, Sch Math & Stat, Xian 710129, Shaanxi, Peoples R China
2 shared publications - Ben Lund
Department of Mathematics Fine Hall Princeton University 08544 Princeton NJ
1 shared publication
Latest Publications
- Open Access
Sphere intersections and incidences over finite fields
We bound the number of incidences between points and spheres in finite vector spaces by bounding the sum of the number of points in the pairwise intersections of the spheres. We obtain new incidence bounds that are interesting when the number of spheres is not too large. Our approach also leads to an elementary proof of the Iosevich-Rudnev bound on the Erdős-Falconer distance problem in odd dimensions.
Open AccessSphere intersections and incidences over finite fields
We bound the number of incidences between points and spheres in finite vector spaces by bounding the sum of the number of points in the pairwise intersections of the spheres. We obtain new incidence bounds that are interesting when the number of spheres is not too large. Our approach also leads to an elementary proof of the Iosevich-Rudnev bound on the Erdős-Falconer distance problem in odd dimensions.
- Open Access
Embedding edge-colored graphs in expanders with roll-back
We introduce a method to embed edge-colored graphs into families of expander graphs, which generalizes a framework developed by Draganić, Krivelevich, and Nenadov (2022). As an application, we show that each family of sufficiently pseudo-random graphs on $n$ vertices contains every edge-colored subdivision of $K_Δ$, provided that the distance between branch vertices in the subdivision is large enough, the average degree of each graph in the family is at least $(1+o(1))Δ$, and the number of vertices in the subdivision is at most $(1-o(1))n$. This work is motivated in part by the problem of finding structures in distance graphs defined over finite vector spaces. For $d\ge 2$ and an odd prime power $q$, consider the vector space $\mathbb{F}_q^d$ over the finite field $\mathbb{F}_q$, where the distance between two points $(x_1,\ldots,x_d)$ and $(y_1,\ldots,y_d)$ is defined to be $\sum_{i=1}^d (x_i-y_i)^2$. A distance graph is a graph associated with a non-zero distance to each of its edges. We show that large subsets of vector spaces over finite fields contain every distance graph that is a nearly spanning subdivision of a complete graph, provided that the distance between branching vertices in the subdivision is large enough.Open AccessEmbedding edge-colored graphs in expanders with roll-back
We introduce a method to embed edge-colored graphs into families of expander graphs, which generalizes a framework developed by Draganić, Krivelevich, and Nenadov (2022). As an application, we show that each family of sufficiently pseudo-random graphs on $n$ vertices contains every edge-colored subdivision of $K_Δ$, provided that the distance between branch vertices in the subdivision is large enough, the average degree of each graph in the family is at least $(1+o(1))Δ$, and the number of vertices in the subdivision is at most $(1-o(1))n$. This work is motivated in part by the problem of finding structures in distance graphs defined over finite vector spaces. For $d\ge 2$ and an odd prime power $q$, consider the vector space $\mathbb{F}_q^d$ over the finite field $\mathbb{F}_q$, where the distance between two points $(x_1,\ldots,x_d)$ and $(y_1,\ldots,y_d)$ is defined to be $\sum_{i=1}^d (x_i-y_i)^2$. A distance graph is a graph associated with a non-zero distance to each of its edges. We show that large subsets of vector spaces over finite fields contain every distance graph that is a nearly spanning subdivision of a complete graph, provided that the distance between branching vertices in the subdivision is large enough. - 19 March 2024
- Published by Elsevier in Discrete Mathematics
- Vol. 347 (7)
Cooperative coloring of some graph families
- 19 March 2024
- Published by Elsevier in Discrete Mathematics
- Vol. 347 (7)
Cooperative coloring of some graph families
- Open Access
Cooperative coloring of some graph families
In a family ${G_1, G_2, \ldots, G_m}$ of graphs sharing the same vertex set $V$, a cooperative coloring involves selecting one independent set $I_i$ from $G_i$ for each $i\in \{1,2,\ldots,m\}$ such that $\bigcup_{i=1}^m I_i = V$. For a graph class $\mathcal{G}$, let $m_{\mathcal{G}}(d)$ denote the minimum $m$ required to ensure that any graph family ${G_1, G_2, \ldots, G_m}$ on the same vertex set, where $G_i\in\mathcal{G}$ and $Δ(G_i)\leq d$ for each $i\in \{1,2,\ldots,m\}$, admits a cooperative coloring. For the graph classes $\mathcal{T}$ (trees) and $\mathcal{W}$ (wheels), we find that $m_\mathcal{T}(3)=4$ and $m_\mathcal{W}(4)=5$. Also, we prove that $m_{\mathcal{B}^*}(d)=O(\log_2 d)$ and $m_{\mathcal{L}}(d)=O\left(\frac{\log d}{\log\log d}\right)$, where $\mathcal{B}^*$ represents the class of graphs whose components are balanced complete bipartite graphs, and $\mathcal{L}$ represents the class of graphs whose components are generalized theta graphs.Open AccessCooperative coloring of some graph families
In a family ${G_1, G_2, \ldots, G_m}$ of graphs sharing the same vertex set $V$, a cooperative coloring involves selecting one independent set $I_i$ from $G_i$ for each $i\in \{1,2,\ldots,m\}$ such that $\bigcup_{i=1}^m I_i = V$. For a graph class $\mathcal{G}$, let $m_{\mathcal{G}}(d)$ denote the minimum $m$ required to ensure that any graph family ${G_1, G_2, \ldots, G_m}$ on the same vertex set, where $G_i\in\mathcal{G}$ and $Δ(G_i)\leq d$ for each $i\in \{1,2,\ldots,m\}$, admits a cooperative coloring. For the graph classes $\mathcal{T}$ (trees) and $\mathcal{W}$ (wheels), we find that $m_\mathcal{T}(3)=4$ and $m_\mathcal{W}(4)=5$. Also, we prove that $m_{\mathcal{B}^*}(d)=O(\log_2 d)$ and $m_{\mathcal{L}}(d)=O\left(\frac{\log d}{\log\log d}\right)$, where $\mathcal{B}^*$ represents the class of graphs whose components are balanced complete bipartite graphs, and $\mathcal{L}$ represents the class of graphs whose components are generalized theta graphs. - 17 July 2023
- Published by Springer Nature in Journal of the Operations Research Society of China
- Vol. 14 (1) , 149-161
Fast Algorithm for the Rainbow Disconnection Coloring of 2-Trees
- 17 July 2023
- Published by Springer Nature in Journal of the Operations Research Society of China
- Vol. 14 (1) , 149-161
Fast Algorithm for the Rainbow Disconnection Coloring of 2-Trees
- 1 December 2020
- Published by Elsevier in Discrete Mathematics
- Vol. 343 (12)
Properly colored ’s in edge-colored graphs- 1 December 2020
- Published by Elsevier in Discrete Mathematics
- Vol. 343 (12)
Properly colored ’s in edge-colored graphs- 1 December 2020
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 287, 15-20
On characterizing the critical graphs for matching Ramsey numbers
- 1 December 2020
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 287, 15-20
On characterizing the critical graphs for matching Ramsey numbers
- Open Access
On characterizing the critical graphs for matching Ramsey numbers
Given simple graphs $H_{1},H_{2},\ldots,H_{c}$, the Ramsey number $r(H_{1},H_{2},\ldots,H_{c})$ is the smallest positive integer $n$ such that every edge-colored $K_{n}$ with $c$ colors contains a subgraph in color $i$ isomorphic to $H_{i}$ for some $i\in\{1,2,\ldots,c\}$. The critical graphs for $r(H_1,H_2,\ldots,H_c)$ are edge-colored complete graphs on $r(H_1,H_2,\ldots,H_c)-1$ vertices with $c$ colors which contain no subgraphs in color $i$ isomorphic to $H_{i}$ for any $i\in \{1,2,\ldots,c\}$. For $n_1\geq n_2\geq \ldots\geq n_c\geq 1$, Cockayne and Lorimer (The Ramsey number for stripes, {\it J.\ Austral.\ Math.\ Soc.} \textbf{19} (1975), 252--256.) showed that $r(n_{1}K_{2},n_{2}K_{2},\ldots,n_{c}K_{2})=n_{1}+1+ \sum\limits_{i=1}^c(n_{i}-1)$, in which $n_{i}K_{2}$ is a matching of size $n_{i}$. Using the Gallai-Edmonds Theorem, we characterized all the critical graphs for $r(n_{1}K_{2},n_{2}K_{2},\ldots,n_{c}K_{2})$, implying a new proof for this Ramsey number.Open AccessOn characterizing the critical graphs for matching Ramsey numbers
Given simple graphs $H_{1},H_{2},\ldots,H_{c}$, the Ramsey number $r(H_{1},H_{2},\ldots,H_{c})$ is the smallest positive integer $n$ such that every edge-colored $K_{n}$ with $c$ colors contains a subgraph in color $i$ isomorphic to $H_{i}$ for some $i\in\{1,2,\ldots,c\}$. The critical graphs for $r(H_1,H_2,\ldots,H_c)$ are edge-colored complete graphs on $r(H_1,H_2,\ldots,H_c)-1$ vertices with $c$ colors which contain no subgraphs in color $i$ isomorphic to $H_{i}$ for any $i\in \{1,2,\ldots,c\}$. For $n_1\geq n_2\geq \ldots\geq n_c\geq 1$, Cockayne and Lorimer (The Ramsey number for stripes, {\it J.\ Austral.\ Math.\ Soc.} \textbf{19} (1975), 252--256.) showed that $r(n_{1}K_{2},n_{2}K_{2},\ldots,n_{c}K_{2})=n_{1}+1+ \sum\limits_{i=1}^c(n_{i}-1)$, in which $n_{i}K_{2}$ is a matching of size $n_{i}$. Using the Gallai-Edmonds Theorem, we characterized all the critical graphs for $r(n_{1}K_{2},n_{2}K_{2},\ldots,n_{c}K_{2})$, implying a new proof for this Ramsey number. - 14 December 2017
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 35 (3) , 778-793
Neighbor sum distinguishing list total coloring of subcubic graphs
- 14 December 2017
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 35 (3) , 778-793
Neighbor sum distinguishing list total coloring of subcubic graphs
- 1 May 2016
- Published by Elsevier in European Journal of Combinatorics
- Vol. 54, 193-200
Rainbow cliques in edge-colored graphs
- 1 May 2016
- Published by Elsevier in European Journal of Combinatorics
- Vol. 54, 193-200
Rainbow cliques in edge-colored graphs