arXiv (All)
open access
A New Method that can Generate Ramsey Colourings for Eight and Thirteen Colours
We study representations for relation algebras corresponding to certain edge colourings of complete graphs. Previously suitable colourings were obtained for the number of colours $n$ up to $2000$, with two exceptions: $n = 8$ and $n = 13$. Using a method that we have called the FBF (Fusion Beautiful
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Colour Relations in Form#717363
- Colored Interaction-Profile Realization: Complexity of Matching-Match on Spiders#1083584
- Review of Denis R. Hirschfeldt, Slicing the Truth: On the Computability Theoretic and Reverse Mathematical Analysis of Combinatorial Principles#725168
- Determining a graph from its reconfiguration graph#927125
- Weighted averages and applications to sets of multiple recurrence#1122579
Record · ID 1063062
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive