{
 "uuid": "9d43ddf1-d063-4c7e-9507-5af8772c0bc7",
 "handle": "uniba/115889",
 "type": "Publication",
 "name": "Going deep and going wide : Counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth",
 "url": "/entities/publication/9d43ddf1-d063-4c7e-9507-5af8772c0bc7/",
 "lastModified": "2026-07-07T02:26:23.558+00:00",
 "metadata": {
  "cris.virtual.author-orcid": [
   {
    "value": "0000-0002-9667-9841"
   },
   {
    "value": null
   },
   {
    "value": null
   },
   {
    "value": null
   }
  ],
  "cris.virtualsource.author-orcid": [
   {
    "value": "140cebad-1c83-4ae3-b6e7-b9006c597b7a"
   },
   {
    "value": "2ac18d24-0eb6-4697-acc8-182d9d6dbb32"
   },
   {
    "value": "74d03727-b384-4985-8407-51787509131e"
   },
   {
    "value": "f9d5e686-547f-465a-a7d9-1580a8d445c6"
   }
  ],
  "dc.contributor.author": [
   {
    "value": "Adler, Isolde",
    "authority": "140cebad-1c83-4ae3-b6e7-b9006c597b7a"
   },
   {
    "value": "Fluck, Eva",
    "authority": "2ac18d24-0eb6-4697-acc8-182d9d6dbb32"
   },
   {
    "value": "Seppelt, Tim",
    "authority": "74d03727-b384-4985-8407-51787509131e"
   },
   {
    "value": "Spitzer, Gian Luca",
    "authority": "f9d5e686-547f-465a-a7d9-1580a8d445c6"
   }
  ],
  "dc.contributor.corporation": [
   {
    "value": "Logical Methods in Computer Science e.V."
   }
  ],
  "dc.date.accessioned": [
   {
    "value": "2026-07-01T11:12:25Z"
   }
  ],
  "dc.date.available": [
   {
    "value": "2026-07-01T11:12:25Z"
   }
  ],
  "dc.date.issued": [
   {
    "value": "2026"
   }
  ],
  "dc.description.abstract": [
   {
    "value": "We study the expressive power of first-order logic with counting quantifiers, especially the k-variable and quantifier-rank-q fragment, using homomorphism indistinguishability. Recently, Dawar, Jakl, and Reggio~(2021) proved that two graphs satisfy the same k-variable and quantifier-rank-q sentences if and only if they are homomorphism indistinguishable over the class of graphs admitting a k-pebble forest cover of depth q. After reproving this result using elementary means, we provide a graph-theoretic analysis of this graph class. This allows us to separate it from the intersection of the class of all graphs of treewidth at most k−1 and the class of all graphs of treedepth at most q, provided that q is sufficiently larger than k.\nWe are able to lift this separation to a (semantic) separation of the respective homomorphism indistinguishability relations. We do this by showing that the graph classes of all graphs of treedepth at most q and of graphs admitting a k-pebble forest cover of depth q are homomorphism distinguishing closed, as conjectured by Roberson~(2022).\nIn order to prove Roberson's conjecture for the class of graphs admitting a k-pebble forest cover of depth q we characterise the class in terms of a monotone Cops-and-Robber game.The crux is to prove that if Cop has a winning strategy then Cop also has a winning strategy that is monotone.To that end, we show how to transform Cop's winning strategy into a pre-tree-decomposition, which is inspired by decompositions of matroids, and then applying an intricate breadth-first `cleaning up' procedure along the pre-tree-decomposition (which may temporarily lose the property of representing a strategy), in order to achieve monotonicity while controlling the number of rounds simultaneously across all branches of the decomposition via a vertex exchange argument."
   }
  ],
  "dc.identifier.doi": [
   {
    "value": "10.46298/lmcs-22(2:33)2026"
   }
  ],
  "dc.identifier.issn": [
   {
    "value": "1860-5974"
   }
  ],
  "dc.identifier.uri": [
   {
    "value": "https://fis.uni-bamberg.de/handle/uniba/115889"
   }
  ],
  "dc.language.iso": [
   {
    "value": "eng"
   }
  ],
  "dc.publisher": [
   {
    "value": "Erlangen"
   }
  ],
  "dc.relation.authororgunit": [
   {
    "value": "Lehrstuhl für Algorithmen und Komplexitätstheorie",
    "authority": "f3517b39-4cd9-434e-85d4-3d8431ee260d"
   },
   {
    "value": null,
    "authority": "#PLACEHOLDER_PARENT_METADATA_VALUE#"
   },
   {
    "value": null,
    "authority": "#PLACEHOLDER_PARENT_METADATA_VALUE#"
   },
   {
    "value": null,
    "authority": "#PLACEHOLDER_PARENT_METADATA_VALUE#"
   }
  ],
  "dc.relation.volume": [
   {
    "value": "22"
   }
  ],
  "dc.subject": [
   {
    "value": "Logic in Computer Science"
   },
   {
    "value": "Discrete Mathematics"
   },
   {
    "value": "Combinatorics"
   }
  ],
  "dc.title": [
   {
    "value": "Going deep and going wide : Counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth"
   }
  ],
  "dc.type": [
   {
    "value": "conferenceobject"
   }
  ],
  "dspace.entity.type": [
   {
    "value": "Publication"
   }
  ],
  "ubg.conference.name": [
   {
    "value": "Annual Conference on Compuer Science Logic"
   }
  ],
  "ubg.fulltexticon": [
   {
    "value": "true"
   }
  ],
  "ubg.generated.csl": [
   {
    "value": "<div class=\"csl-bib-body\">\n  <div class=\"csl-entry\">Adler, Isolde; Fluck, Eva; Seppelt, Tim; u. a. (2026): Going deep and going wide : Counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth, in: <i>Logical methods in computer science : LMCS</i>, Erlangen, S. 33:1–33:48, doi: 10.46298/lmcs-22(2:33)2026.</div>\n</div>"
   }
  ],
  "ubg.generated.cslContainerTitle": [
   {
    "value": "Logical methods in computer science : LMCS"
   }
  ],
  "ubg.generated.cslDoi": [
   {
    "value": "10.46298/lmcs-22(2:33)2026"
   }
  ],
  "ubg.intern.org": [
   {
    "value": "Lehrstuhl für Algorithmen und Komplexitätstheorie",
    "authority": "f3517b39-4cd9-434e-85d4-3d8431ee260d"
   }
  ],
  "ubg.intern.vonfeld": [
   {
    "value": "",
    "language": "de_DE"
   }
  ],
  "ubg.intern.vonfeldeditor": [
   {
    "value": "",
    "language": "de_DE"
   }
  ],
  "ubg.pages.range": [
   {
    "value": "33:1–33:48"
   }
  ],
  "ubg.relation.issue": [
   {
    "value": "2"
   }
  ],
  "ubg.submission.type": [
   {
    "value": "full-text"
   }
  ],
  "ubg.titleparent.journal": [
   {
    "value": "Logical methods in computer science : LMCS"
   }
  ],
  "ubg.version.hasversions": [
   {
    "value": "uniba/115964",
    "authority": "8051d828-50d2-4fb4-a3cf-0b22a9943953"
   }
  ]
 },
 "relations": {},
 "files": []
}