Xiutao Zhu

According to our database, Xiutao Zhu authored at least 12 papers between 2021 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

A New Construction for the Planar Turán Number of Cycles.

Ervin Györi, Kitti Varga, Xiutao Zhu

Graphs Comb., December, 2024

Maximum cliques in a graph without disjoint given subgraph.

Fangfang Zhang, Yaojun Chen, Ervin Györi, Xiutao Zhu

Discret. Math., April, 2024

Generalized Turán numbers for the edge blow-up of a graph.

Zequn Lv, Ervin Györi, Zhen He, Nika Salia, Casey Tompkins, Kitti Varga, Xiutao Zhu

Discret. Math., January, 2024

The maximum number of copies of an even cycle in a planar graph.

Zequn Lv, Ervin Györi, Zhen He, Nika Salia, Casey Tompkins, Xiutao Zhu

J. Comb. Theory B, 2024

Extremal Results for Graphs Avoiding a Rainbow Subgraph.

Zhen He, Peter Frankl, Ervin Györi, Zequn Lv, Nika Salia, Casey Tompkins, Kitti Varga, Xiutao Zhu

Electron. J. Comb., 2024

2023

Edges Not Covered by Monochromatic Bipartite Graph.

Xiutao Zhu, Ervin Györi, Zhen He, Zequn Lv, Nika Salia, Casey Tompkins, Kitti Varga

SIAM J. Discret. Math., December, 2023

The maximum number of triangles in Fk-free graphs.

Xiutao Zhu, Yaojun Chen, Dániel Gerbner, Ervin Györi, Hilal Hama Karim

Eur. J. Comb., December, 2023

Turán number for odd-ballooning of trees.

Xiutao Zhu, Yaojun Chen

J. Graph Theory, October, 2023

2022

Generalized Turán number for linear forests.

Xiutao Zhu, Yaojun Chen

Discret. Math., 2022

2021

Generalized Turán Number of Even Linear Forests.

Xiutao Zhu, Fangfang Zhang, Yaojun Chen

Graphs Comb., 2021

Inverting the Turán problem with chromatic number.

Xiutao Zhu, Yaojun Chen

Discret. Math., 2021

Gallai-Ramsey numbers for multiple triangles.

Fangfang Zhang, Xiutao Zhu, Yaojun Chen

Discret. Appl. Math., 2021