Zhiyang He

most citedNew Upper Bound on Extremal Number of Even Cycles

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

collaborators

3 papers

cs.DS2020

Near-linear-time, Optimal Vertex Cut Sparsifiers in Directed Acyclic Graphs

Zhiyang He, Jason Li, Magnus Wahlström

Let $G$ be a graph and $S, T \subseteq V (G)$ be (possibly overlapping) sets of terminals, $∣ S ∣ = ∣ T ∣ = k$ . We are interested in computing a vertex sparsifier for terminal cuts in $G$ ,…

math.CO2020★ 2 cited

New Upper Bound on Extremal Number of Even Cycles

Zhiyang He

In this paper, we prove $ex (n, C_{2 k}) \leq (165 k lo g k + o (1)) \cdot n^{1 + 1/ k}$ . We improved on Bukh--Jiang's method used in their 2017 publication, thereby redu…

math.CO2018

Hypergraphs with few Berge paths of fixed length between vertices

Zhiyang He, Michael Tait

In this paper we study the maximum number of hyperedges which may be in an $r$ -uniform hypergraph under the restriction that no pair of vertices has more than $t$ Berge paths of le…