Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2503.00189

Coloring one-headed directed hypergraphs

Balázs István Szabó
View original source ↗Read source document ↗Export metadata ↓

Abstract

A directed hypergraph is a hypergraph in which the vertex set of each hyperedge is partitioned into two disjoint parts, a head and a tail. Keszegh and Pálvölgyi posed the following conjecture. Let $H$ be a directed hypergraph such that in every hyperedge the number of head-vertices is less than the number of tail-vertices and assume that for every pair of hyperedges $e_{1},e_{2}\in E(H)$ with $|e_{1}\cap e_{2}|=1$, the common vertex is a head-vertex in at least one of the hyperedges. Then $H$ admits a proper 2-coloring. Keszegh showed that the conjecture is also true in the special case of 3-uniform hypergraphs. A directed hypergraph is called one-headed if every hyperedge has exactly one head-vertex. The main result of this paper is that the conjecture is true for one-headed directed hypergraphs with all hyperedges having size at least three. Directed 3-uniform hypergraphs such that in every hyperedge the number of head-vertices is one and the number of tail-vertices is two are called $2\rightarrow 1$ hypergraphs. In this paper we consider sufficient conditions for $2\rightarrow 1$ hypergraphs to be proper $k$-colorable for some small $k$.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Balázs István Szabó. 2025-02-28. Coloring one-headed directed hypergraphs. https://arxiv.org/abs/2503.00189

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗