activity
20232026
most citedBipartite Turán problems via graph gluing

1 citations · 1 across the 7 of their papers we have counts for

collaborators

7 papers

math.CO2026

Sharp bounds on -wise generalizations of oddtowns and eventowns

Zichao Dong, Minghui Ouyang, Lan Wei

For , an -town is a set family in which every -wise intersection has parity . Denote by $f_{\boldsymbolα}…

math.CO2026

A dichotomy for hypergraph Zarankiewicz problems on axis-parallel boxes

Ting-Wei Chao, Zichao Dong, Hong Liu +2

We study the Zarankiewicz problem for -partite, -uniform intersection hypergraphs arising from families of axis-parallel boxes in with prescribed direction…

math.CO2025

Large grid subsets without many cospherical points

Zichao Dong, Zijian Xu

Motivated by intuitions from projective algebraic geometry, we provide a novel construction of subsets of the -dimensional grid of size with no points…

math.CO2025

Induced rational exponents and bipartite subgraphs in -free graphs

Zichao Dong, Jun Gao, Ruonan Li +1

In this paper, we study a general phenomenon that many extremal results for bipartite graphs can be transferred to the induced setting when the host graph is -free. As ma…

math.CO2025

Set families: restricted distances via restricted intersections

Zichao Dong, Jun Gao, Hong Liu +2

Denote by the maximum size of a set family on with distance set . That is, holds for every pair of di…

math.CO2025★ 1 cited

Bipartite Turán problems via graph gluing

Zichao Dong, Jun Gao, Hong Liu

For graphs and , if we glue them by identifying a given pair of vertices and , what is the extremal number of the resulting graph $H_1^u \od…

math.CO2023

Saturation results around the Erdős--Szekeres problem

Gábor Damásdi, Zichao Dong, Manfred Scheucher +1

In this paper, we consider saturation problems related to the celebrated Erdős--Szekeres convex polygon problem. For each , we construct a planar point set of size $(7/8)…