Hitting sets and colorings of hypergraphs

Hitting sets and colorings of hypergraphs

In this paper we study the minimal size of edges in hypergraph families that guarantees the existence of a polychromatic coloring, that is, a $k$-coloring of a vertex set such that every hyperedge contains a vertex of all $k$ color classes. We also investigate the connection of this problem with $c$...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Bursics, Balázs, Csonka, Bence, Szepessy, Luca
Format: Artikel
Sprache:eng
Schlagworte:
Mathematics - Combinatorics
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Bursics, Balázs
Csonka, Bence
Szepessy, Luca
description In this paper we study the minimal size of edges in hypergraph families that guarantees the existence of a polychromatic coloring, that is, a $k$-coloring of a vertex set such that every hyperedge contains a vertex of all $k$ color classes. We also investigate the connection of this problem with $c$-shallow hitting sets: sets of vertices that intersect each hyperedge in at least one and at most $c$ vertices. We determine for some hypergraph families the minimal $c$ for which a $c$-shallow hitting set exists. We also study this problem for a special hypergraph family, which is induced by arithmetic progressions with a difference from a given set. We show connections between some geometric hypergraph families and the latter, and prove relations between the set of differences and polychromatic colorability.
doi_str_mv 10.48550/arxiv.2307.12154
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2307_12154</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2307_12154</sourcerecordid><originalsourceid>FETCH-LOGICAL-a674-50bbee3318f101d71dada37e9f38594a1b3842a38709fbf0296429370507b5623</originalsourceid><addsrcrecordid>eNotzrFuwjAUhWEvDAh4ACa8MiRc-9qxPSLUlkpILOzRNbEhEpDIjlB5-wLtdKR_OPoYmwsoldUaVpR-2nspEUwppNBqzJbbdhja24nnMGROt4Yfu0uXniXzLvLzow_plKg_5ykbRbrkMPvfCTt8fhw222K3__rerHcFVUYVGrwPAVHYKEA0RjTUEJrgIlrtFAmPVklCa8BFH0G6SkmHBjQYryuJE7b4u31b6z61V0qP-mWu32b8BRXoOmo</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Hitting sets and colorings of hypergraphs</title><source>arXiv.org</source><creator>Bursics, Balázs ; Csonka, Bence ; Szepessy, Luca</creator><creatorcontrib>Bursics, Balázs ; Csonka, Bence ; Szepessy, Luca</creatorcontrib><description>In this paper we study the minimal size of edges in hypergraph families that guarantees the existence of a polychromatic coloring, that is, a $k$-coloring of a vertex set such that every hyperedge contains a vertex of all $k$ color classes. We also investigate the connection of this problem with $c$-shallow hitting sets: sets of vertices that intersect each hyperedge in at least one and at most $c$ vertices. We determine for some hypergraph families the minimal $c$ for which a $c$-shallow hitting set exists. We also study this problem for a special hypergraph family, which is induced by arithmetic progressions with a difference from a given set. We show connections between some geometric hypergraph families and the latter, and prove relations between the set of differences and polychromatic colorability.</description><identifier>DOI: 10.48550/arxiv.2307.12154</identifier><language>eng</language><subject>Mathematics - Combinatorics</subject><creationdate>2023-07</creationdate><rights>http://creativecommons.org/licenses/by/4.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2307.12154$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2307.12154$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Bursics, Balázs</creatorcontrib><creatorcontrib>Csonka, Bence</creatorcontrib><creatorcontrib>Szepessy, Luca</creatorcontrib><title>Hitting sets and colorings of hypergraphs</title><description>In this paper we study the minimal size of edges in hypergraph families that guarantees the existence of a polychromatic coloring, that is, a $k$-coloring of a vertex set such that every hyperedge contains a vertex of all $k$ color classes. We also investigate the connection of this problem with $c$-shallow hitting sets: sets of vertices that intersect each hyperedge in at least one and at most $c$ vertices. We determine for some hypergraph families the minimal $c$ for which a $c$-shallow hitting set exists. We also study this problem for a special hypergraph family, which is induced by arithmetic progressions with a difference from a given set. We show connections between some geometric hypergraph families and the latter, and prove relations between the set of differences and polychromatic colorability.</description><subject>Mathematics - Combinatorics</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotzrFuwjAUhWEvDAh4ACa8MiRc-9qxPSLUlkpILOzRNbEhEpDIjlB5-wLtdKR_OPoYmwsoldUaVpR-2nspEUwppNBqzJbbdhja24nnMGROt4Yfu0uXniXzLvLzow_plKg_5ykbRbrkMPvfCTt8fhw222K3__rerHcFVUYVGrwPAVHYKEA0RjTUEJrgIlrtFAmPVklCa8BFH0G6SkmHBjQYryuJE7b4u31b6z61V0qP-mWu32b8BRXoOmo</recordid><startdate>20230722</startdate><enddate>20230722</enddate><creator>Bursics, Balázs</creator><creator>Csonka, Bence</creator><creator>Szepessy, Luca</creator><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20230722</creationdate><title>Hitting sets and colorings of hypergraphs</title><author>Bursics, Balázs ; Csonka, Bence ; Szepessy, Luca</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a674-50bbee3318f101d71dada37e9f38594a1b3842a38709fbf0296429370507b5623</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Mathematics - Combinatorics</topic><toplevel>online_resources</toplevel><creatorcontrib>Bursics, Balázs</creatorcontrib><creatorcontrib>Csonka, Bence</creatorcontrib><creatorcontrib>Szepessy, Luca</creatorcontrib><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Bursics, Balázs</au><au>Csonka, Bence</au><au>Szepessy, Luca</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Hitting sets and colorings of hypergraphs</atitle><date>2023-07-22</date><risdate>2023</risdate><abstract>In this paper we study the minimal size of edges in hypergraph families that guarantees the existence of a polychromatic coloring, that is, a $k$-coloring of a vertex set such that every hyperedge contains a vertex of all $k$ color classes. We also investigate the connection of this problem with $c$-shallow hitting sets: sets of vertices that intersect each hyperedge in at least one and at most $c$ vertices. We determine for some hypergraph families the minimal $c$ for which a $c$-shallow hitting set exists. We also study this problem for a special hypergraph family, which is induced by arithmetic progressions with a difference from a given set. We show connections between some geometric hypergraph families and the latter, and prove relations between the set of differences and polychromatic colorability.</abstract><doi>10.48550/arxiv.2307.12154</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2307.12154
ispartof
issn
language eng
recordid cdi_arxiv_primary_2307_12154
source arXiv.org
subjects Mathematics - Combinatorics
title Hitting sets and colorings of hypergraphs
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-29T04%3A35%3A16IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Hitting%20sets%20and%20colorings%20of%20hypergraphs&rft.au=Bursics,%20Bal%C3%A1zs&rft.date=2023-07-22&rft_id=info:doi/10.48550/arxiv.2307.12154&rft_dat=%3Carxiv_GOX%3E2307_12154%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true