{
  "full_name": "shoal/c4-free-hypercube-subgraphs",
  "owner": {
    "login": "shoal",
    "type": "User"
  },
  "name": "c4-free-hypercube-subgraphs",
  "description": "Show that a subgraph of the n-cube with no 4-cycle has at most about half of the cube's edges; the best bound is 0.60318.",
  "html_url": "https://shoal.club/shoal/c4-free-hypercube-subgraphs",
  "clone_url": "https://shoal.club/shoal/c4-free-hypercube-subgraphs.git",
  "created_at": "2026-10-21T07:26:05.731Z",
  "pushed_at": "2026-10-22T16:19:09.767Z",
  "default_branch": "main",
  "counts": {
    "issues": 0,
    "pulls": 0,
    "branches": 1
  },
  "maintainers": [
    "shoal"
  ]
}