1 citations · 2 across the 8 of their papers we have counts for
10 papers
Off-diagonal Ramsey numbers for 3-uniform tight hypergraph cycles
Eng Keat Hng
Let be the -uniform tight cycle on vertices, that is, the -uniform hypergraph on a cyclically ordered set of vertices whose edges are precisely the triple…
No extremal square-free words over alphabets of size at least 5
Eng Keat Hng, Silas Rathke
A word over an alphabet contains a square if it has a subword of the form where is a word. A word is \emph{extremal square-free} if it does not contain a s…
Ramsey size linear and generalization
Eng Keat Hng, Meng Ji, Ander Lamaison
More than thirty years ago, Erdős, Faudree, Rousseau, and Schelp posed a fundamental question in extremal graph theory: What is the optimal constant such that $r(C_{2k+1}, G)…
Graphon branching processes and fractional isomorphism
Jan Hladký, Eng Keat Hng, Anna Margarethe Limbach
In their study of the giant component in inhomogeneous random graphs, Bollobás, Janson, and Riordan introduced a class of branching processes parametrized by a possibly unbounded g…
Characterization of flip process rules with the same trajectories
Eng Keat Hng
Garbe, Hladký, Šileikis and Skerman [Ann. Inst. Henri Poincaré Probab. Stat., 60 (2024), pp. 2878-2922] recently introduced a general class of random graph processes called flip pr…
Approximating fractionally isomorphic graphons
Jan Hladký, Eng Keat Hng
Grebík and Rocha [Fractional Isomorphism of Graphons, Combinatorica 42, pp 365-404 (2022)] extended the well studied notion of fractional isomorphism of graphs to graphons. We prov…
Density of small diameter subgraphs in -free graphs
Eng Keat Hng, Domenico Mergoni Cecchelli
We denote by the maximum number of copies of in an -vertex graph that does not contain as a subgraph. Recently, Grzesik, Győri, Salia, Tompkins cons…
Prominent examples of flip processes
Pedro Araújo, Jan Hladký, Eng Keat Hng +1
Flip processes, introduced in [Garbe, Hladký, Šileikis, Skerman: From flip processes to dynamical systems on graphons], are a class of random graph processes defined using a rule w…
Minimum degrees for powers of paths and cycles
Eng Keat Hng
We study minimum degree conditions under which a graph contains th powers of paths and cycles of arbitrary specified lengths. We determine precise thresholds, assuming that…
Longest paths in random hypergraphs
Oliver Cooley, Frederik Garbe, Eng Keat Hng +3
Given integers with , we consider the length of the longest -tight path in the binomial random -uniform hypergraph . We show that this length…