<?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-07-22T13:39:09Z</responseDate>
  <request identifier="23213" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:23213</identifier>
        <datestamp>2025-10-02T12:43:14Z</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>k-Dimensional Transversals for Fat Convex Sets</dc:title>
          <dc:creator>Jung, Attila</dc:creator>
          <dc:creator>Pálvölgyi, Dömötör</dc:creator>
          <dc:subject>discrete geometry</dc:subject>
          <dc:subject>transversals</dc:subject>
          <dc:subject>Helly</dc:subject>
          <dc:subject>hypergraphs</dc:subject>
          <dc:description>We prove a fractional Helly theorem for k-flats intersecting fat convex sets. A family ℱ of sets is said to be ρ-fat if every set in the family contains a ball and is contained in a ball such that the ratio of the radii of these balls is bounded by ρ. We prove that for every dimension d and positive reals ρ and α there exists a positive β = β(d,ρ, α) such that if ℱ is a finite family of ρ-fat convex sets in ℝ^d and an α-fraction of the (k+2)-size subfamilies from ℱ can be hit by a k-flat, then there is a k-flat that intersects at least a β-fraction of the sets of ℱ. We prove spherical and colorful variants of the above results and prove a (p,k+2)-theorem for k-flats intersecting balls.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Attila Jung and Dömötör Pálvölgyi</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.61</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-232136</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.61</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>
