Given a sequence $\mathbf{a}=(a_i)_{i\geq 1}$ of positive real numbers, we say that a colouring $c:E(K_n)\to \mathbb{N}$ is $\mathbf{a}$-bounded if the proportion of edges coloured $i$ is at most $a_i$, for all $i$. We write \[ \mathbf{a}\, \to\, K_k \] if, for all sufficiently large $n$, all $\mathbf{a}$-bounded colou...
Francesco Di Braccio, Simon Griffiths, Pedram Noohi et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.