Ji Zeng

activity

20242026

collaborators

3 papers

math.CO2026

On the $(k + 2, k)$ -problem of Brown, Erdős and Sós for even integers $k$

Yan Wang, Jiasheng Zeng

Let $f^{(r)} (n; s, k)$ denote the maximum number of edges in an $r$ -graph on $n$ vertices in which every $k$ edges span more than $s$ vertices. Brown, Erdős and Sós in 1973 conjectur…

math.CO2025

Unavoidable patterns and plane paths in dense topological graphs

Balázs Keszegh, Andrew Suk, Gábor Tardos +1

Let $C_{s, t}$ be the complete bipartite geometric graph, with $s$ and $t$ vertices on two distinct parallel lines respectively, and all $s t$ straight-line edges drawn between them…

math.CO2024

3-uniform monotone paths and multicolor Ramsey numbers

Andrew Suk, Ji Zeng

The monotone path $P_{n + 2}$ is an ordered 3-uniform hypergraph whose vertex set has size $n + 2$ and edge set consists of all consecutive triples. In this note, we consider the colle…

On the (k+2,k)-problem of Brown, Erdős and Sós for even integers k

Unavoidable patterns and plane paths in dense topological graphs

3-uniform monotone paths and multicolor Ramsey numbers

On the $(k + 2, k)$ -problem of Brown, Erdős and Sós for even integers $k$