{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreiaxqvpimst3efcf2kd6mc25ul4qd3n74jbsyjlb5jjyamfy7nk47e",
    "uri": "at://did:plc:4rgrdigiftglskeax4wvmsev/app.bsky.feed.post/3mlkm7skkdb22"
  },
  "coverImage": {
    "$type": "blob",
    "ref": {
      "$link": "bafkreiflo6xt7is6b2iafwghkjahlgggocme5jwjsbeuqqwcywuvjhmszm"
    },
    "mimeType": "image/png",
    "size": 24783
  },
  "path": "/abs/2605.08016v1",
  "publishedAt": "2026-05-11T00:00:00.000Z",
  "site": "https://arxiv.org",
  "tags": [
    "Archit Chauhan",
    "Rohit Gurjar",
    "Kilian Rothmund",
    "Thomas Thierauf"
  ],
  "textContent": "**Authors:** Archit Chauhan, Rohit Gurjar, Kilian Rothmund, Thomas Thierauf\n\nThe problem of recognizing (k, l)-tight graphs is a fundamental problem that has close connections to well studied problems like graph rigidity. The problem is better understood for planar graphs as compared to general graphs. For example, deterministic NC-algorithms for the problem are known for planar graphs, but no such algorithm is known for general graphs. A common approach to reduce a graph problem to the planar case is to use planarizing gadgets. Our main contribution is to show that, unconditionally, planarizing gadgets for the problem of recognizing (k, l)-tight graphs do not exist.",
  "title": "Planarizing Gadgets for (k, l)-tight Graphs Do Not Exist"
}