Stability for the Erdős-Rothschild problem
Given a sequence $\boldsymbol {k} := (k_1,\ldots ,k_s)$ of natural numbers and a graph G, let $F(G;\boldsymbol {k})$ denote the number of colourings of the edges of G with colours $1,\dots ,s$ , such that, for every $c \in \{1,\dots ,s\}$ , the edges of colour c contain no...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Cambridge University Press
2023-01-01
|
| Series: | Forum of Mathematics, Sigma |
| Subjects: | |
| Online Access: | https://www.cambridge.org/core/product/identifier/S2050509423000129/type/journal_article |