4 papers
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…
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…
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…