The Ramsey multiplicity problem asks for the minimum asymptotic density ...
Given two non-empty graphs H and T, write H≽ T to mean that
t(H,G)^|E(T)...
A sequence π_1,π_2,… of permutations is said to be "quasirandom" if
the ...
A graph H is said to be common if the number of monochromatic labelled
c...
Liquid democracy has a natural graphical representation, the delegation
...
Given a loop-free graph H, the reconfiguration problem for homomorphisms...
For a fixed graph H, the reconfiguration problem for H-colourings (i.e.
...