7 papers
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_{\boldsym…
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…
Set families: restricted distances via restricted intersections
Zichao Dong, Jun Gao, Hong Liu +2
Denote by the maximum size of a set family on $[n] \stackrel{\mbox{\normalfont\tiny def}}{=} \{1, \dots, n\}$ with distance set . That is, $|A \bigtriangl…
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…
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)…
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…