2000 character limit reached
Flip colouring of graphs II
Published 4 Jan 2024 in math.CO | (2401.02315v2)
Abstract: We give results concerning two problems on the recently introduced flip colourings of graphs, a new class of local v. global phenomena. We prove that for $(b, r)$-flip sequences with $4 \leq b < r < b + 2 \left\lfloor\frac{b+2}{6}\right\rfloor2$, small constructions of $(b,r)$-flip graphs on $O(b+r)$ vertices are possible. Furthermore, we prove that there exists $k$-flip sequences $(a_1, \dots, a_k)$ where $k > 4$, such that $a_k$ can be arbitrarily large whilst $a_i$ is constant for $1 \leq i < \frac{k}{4}$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.