Jian-Chu Zeng

activity

20212023

collaborators

4 papers

math.CO2023

Note on disjoint faces in simple topological graphs

Ji Zeng

We prove that every $n$ -vertex complete simple topological graph generates at least $Ω (n)$ pairwise disjoint $4$ -faces. This improves upon a recent result by Hubard and Suk. As an…

math.CO2022

On asymptotic packing of convex geometric and ordered graphs

Jiaxi Nie, Erlang Surya, Ji Zeng

A convex geometric graph $G$ is said to be packable if there exist edge-disjoint copies of $G$ in the complete convex geometric graph $K_{n}$ covering all but $o (n^{2})$ edges. We prov…

math.CO2022

Unavoidable patterns in complete simple topological graphs

Andrew Suk, Ji Zeng

We show that every complete $n$ -vertex simple topological graph contains a topological subgraph on at least $(lo g n)^{1/4 - o (1)}$ vertices that is weakly isomorphic to the comple…

math.CO2021

On average hitting time and Kemeny's constant for weighted trees

Ji Zeng

For a connected graph $G$ , the average hitting time $α (G)$ and the Kemeny's constant $κ (G)$ are two similar quantities, both measuring the time for the random walk on $G$ to travel…