Jae-Baek Lee

activity

20172024

most citedReconfiguring Graph Homomorphisms on the Sphere

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

collaborators

6 papers

math.CO2024

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…

math.CO2023

Turán Colourings in Off-Diagonal Ramsey Multiplicity

Joseph Hyde, Jae-baek Lee, Jonathan A. Noel

The \emph{Ramsey multiplicity constant} of a graph $H$ is the limit as $n$ tends to infinity of the minimum density of monochromatic labeled copies of $H$ in a $2$ -edge colouring o…

math.CO2023

Disconnected Common Graphs via Supersaturation

Jae-baek Lee, Jonathan A. Noel

A graph $H$ is said to be common if the number of monochromatic labelled copies of $H$ in a $2$ -colouring of the edges of a large complete graph is asymptotically minimized by a ra…

math.CO2022

Mixing is hard for triangle-free reflexive graphs

Hyobeen Kim, Jae-baek Lee, Mark Siggers

In the problem $Mix (H)$ one is given a graph $G$ and must decide if the Hom-graph $Hom (G, H)$ is connected. We show that if $H$ is a triangle-free reflexive graph…

math.CO2018★ 6 cited

Reconfiguring Graph Homomorphisms on the Sphere

Jae-Baek Lee, Jonathan A. Noel, Mark Siggers

Given a loop-free graph $H$ , the reconfiguration problem for homomorphisms to $H$ (also called $H$ -colourings) asks: given two $H$ -colourings $f$ of $g$ of a graph $G$ , is it possi…

math.CO2017★ 4 cited

Graph Homomorphism Reconfiguration and Frozen $H$ -Colourings

Richard C. Brewster, Jae-Baek Lee, Benjamin Moore +2

For a fixed graph $H$ , the reconfiguration problem for $H$ -colourings (i.e. homomorphisms to $H$ ) asks: given a graph $G$ and two $H$ -colourings $φ$ and $ψ$ of $G$ , does there exis…