4 citations · 4 across the 3 of their papers we have counts for
4 papers · 1 filter
Forcing quasirandomness with 4-point permutations
Daniel Kráľ, Jae-baek Lee, Jonathan A. Noel
A combinatorial object is said to be quasirandom if it exhibits certain properties that are typically seen in a truly random object of the same kind. It is known that a permutation…
Turán Colourings in Off-Diagonal Ramsey Multiplicity
Joseph Hyde, Jae-baek Lee, Jonathan A. Noel
The \emph{Ramsey multiplicity constant} of a graph is the limit as tends to infinity of the minimum density of monochromatic labeled copies of in a -edge colouring o…
Disconnected Common Graphs via Supersaturation
Jae-baek Lee, Jonathan A. Noel
A graph is said to be common if the number of monochromatic labelled copies of in a -colouring of the edges of a large complete graph is asymptotically minimized by a ra…
Graph Homomorphism Reconfiguration and Frozen -Colourings
Richard C. Brewster, Jae-Baek Lee, Benjamin Moore +2
For a fixed graph , the reconfiguration problem for -colourings (i.e. homomorphisms to ) asks: given a graph and two -colourings and of , does there exis…