<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-08-10T22:31:12Z</responseDate>
  <request identifier="23154" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:23154</identifier>
        <datestamp>2025-10-02T12:41:22Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>The Maximum Number of Digons Formed by Pairwise Intersecting Pseudocircles</dc:title>
          <dc:creator>Ackerman, Eyal</dc:creator>
          <dc:creator>Damásdi, Gábor</dc:creator>
          <dc:creator>Keszegh, Balázs</dc:creator>
          <dc:creator>Pinchasi, Rom</dc:creator>
          <dc:creator>Raffay, Rebeka</dc:creator>
          <dc:subject>pairwise intersecting arrangement</dc:subject>
          <dc:subject>arrangement of pseudocircles</dc:subject>
          <dc:subject>counting digons</dc:subject>
          <dc:subject>tangencies</dc:subject>
          <dc:subject>Grünbaum’s conjecture</dc:subject>
          <dc:description>In 1972, Branko Grünbaum conjectured that any nontrivial arrangement of n &gt; 2 pairwise intersecting pseudocircles in the plane can have at most 2n-2 digons (regions enclosed by exactly two pseudoarcs), with the bound being tight. While this conjecture has been confirmed for cylindrical arrangements of pseudocircles and more recently for geometric circles, we extend these results to any simple arrangement of pairwise intersecting pseudocircles.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Eyal Ackerman and Gábor Damásdi and Balázs Keszegh and Rom Pinchasi and Rebeka Raffay</dc:contributor>
          <dc:date>2025</dc:date>
          <dc:relation>Is Part Of LIPIcs, Volume 332, 41st International Symposium on Computational Geometry (SoCG 2025)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/LIPIcs.SoCG.2025.2</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-231548</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.2</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
