Conflict free colorings of (strongly) almost disjoint set-systems

DOI10.1007/s10474-010-0051-5zbMath1274.03074arXiv1004.0181OpenAlexW1984549286MaRDI QIDQ1945294

István Juhász, Zoltán Szentmiklóssy, Lajos Soukup, Andras Hajnal

Publication date: 5 April 2013

Published in: Acta Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1004.0181

zbMATH Keywords

conflict-free coloringalmost disjoint setsessentially disjoint sets

Mathematics Subject Classification ID

Consistency and independence results (03E35) Other combinatorial set theory (03E05)

Related Items (5)

Minimal vertex covers in infinite hypergraphs ⋮ Essentially disjoint families, conflict free colorings and Shelah's revised GCH ⋮ Splitting families of sets in ZFC ⋮ Conflict free colorings of nonuniform systems of infinite sets ⋮ INFINITE COMBINATORICS PLAIN AND SIMPLE

Cites Work

• Unnamed Item
• Unnamed Item
• Families close to disjoint ones
• Transversals for strongly almost disjoint families
• Conflict-Free Colourings of Graphs and Hypergraphs
• Splitting Strongly Almost Disjoint Families
• Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
• Deterministic conflict-free coloring for intervals
• On the complete subgraphs of graphs defined by systems of sets
• On a property of families of sets

This page was built for publication: Conflict free colorings of (strongly) almost disjoint set-systems