Jinyoung Park

activity

20172023

most citedDeep neural network for solving differential equations motivated by Legendre-Galerkin approximation

5 citations · 6 across the 6 of their papers we have counts for

collaborators

Showing 2020 · math.COShow all

2 papers · 2 filters

math.CO2020

The threshold for the square of a Hamilton cycle

Jeff Kahn, Bhargav Narayanan, Jinyoung Park

Resolving a conjecture of Kühn and Osthus from 2012, we show that $p = 1/ n$ is the threshold for the random graph $G_{n, p}$ to contain the square of a Hamilton cycle.

math.CO2020

Tuza's Conjecture for random graphs

Jeff Kahn, Jinyoung Park

A celebrated conjecture of Zs. Tuza says that in any (finite) graph, the minimum size of a cover of triangles by edges is at most twice the maximum size of a set of edge-disjoint t…