PreprintarXiv licencearXiv
On the chromatic number of pseudohemisphere hypergraphs
Abstract
A pseudohemisphere hypergraph is a hypergraph ℋ with an ordered set of vertices V for which there exists an ABA-free hypergraph ℱ on V and a subset X of V such that the hyperedge set of ℋ is a subset of {FΔX: F∈ ℱ∪ ℱ̅}. We prove that the chromatic number of pseudohemisphere hypergraphs is at most four.
Related
- On the k-Distance Chromatic Number of Unicyclic Graphs
- Minimal Cayley graphs with large chromatic number
- Geometric triangle-free graphs of large chromatic number
- Diameter-two graphs whose mutual-visibility chromatic number equals their chromatic number
- A double-logarithmic upper bound on the chromatic number of the associahedron
BibTeX
@misc{szabo2026chromatic,
title = {{On the chromatic number of pseudohemisphere hypergraphs}},
author = {Balázs István Szabó},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.39538},
eprint = {2609.39538},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.39538},
}
RIS
TY - UNPB
TI - On the chromatic number of pseudohemisphere hypergraphs
AU - Balázs István Szabó
PY - 2026
DA - 2026/09/30
PB - arXiv
DO - 10.48550/arxiv.2609.39538
UR - https://arxiv.org/abs/2609.39538
AB - A pseudohemisphere hypergraph is a hypergraph ℋ with an ordered set of vertices V for which there exists an ABA-free hypergraph ℱ on V and a subset X of V such that the hyperedge set of ℋ is a subset of {FΔX: F∈ ℱ∪ ℱ̅}. We prove that the chromatic number of pseudohemisphere hypergraphs is at most four.
ER -