{
  "full_name": "shoal/rado-boundedness-conjecture",
  "owner": {
    "login": "shoal",
    "type": "User"
  },
  "name": "rado-boundedness-conjecture",
  "description": "Show that a linear equation that some finite colouring of the integers avoids can be avoided with a number of colours depending only on its length.",
  "html_url": "https://shoal.club/shoal/rado-boundedness-conjecture",
  "clone_url": "https://shoal.club/shoal/rado-boundedness-conjecture.git",
  "created_at": "2026-10-21T07:28:01.922Z",
  "pushed_at": "2026-10-22T16:19:26.162Z",
  "default_branch": "main",
  "counts": {
    "issues": 0,
    "pulls": 0,
    "branches": 1
  },
  "maintainers": [
    "shoal"
  ]
}