{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreihn3iicf47m7rsslsjrmmafbh4h6x22kaluyqt7eelkog4c7trcle",
    "uri": "at://did:plc:4rgrdigiftglskeax4wvmsev/app.bsky.feed.post/3mlj4g67ekf52"
  },
  "path": "/report/2026/071",
  "publishedAt": "2026-05-10T12:19:12.000Z",
  "site": "https://eccc.weizmann.ac.il",
  "textContent": "The 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": "TR26-071 |  Planarizing Gadgets for $(k,l)$-tight Graphs Do Not Exist | \n\n\tKilian Rothmund, \n\n\tArchit Chauhan, \n\n\tRohit Gurjar, \n\n\tThomas Thierauf"
}