Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2504.04585

Balanced colorings of Erdős-Rényi hypergraphs

Abhishek Dhawan·Yuzhou Wang
View original source ↗Read source document ↗Export metadata ↓

Abstract

An $r$-uniform hypergraph $H = (V, E)$ is $r$-partite if there exists a partition of the vertex set into $r$ parts such that each edge contains exactly one vertex from each part. We say an independent set in such a hypergraph is balanced if it contains an equal number of vertices from each partition. The balanced chromatic number of $H$ is the minimum value $q$ such that $H$ admits a proper $q$-coloring where each color class is a balanced independent set. In this note, we determine the asymptotic behavior of the balanced chromatic number for sparse $r$-uniform $r$-partite Erdős--Rényi hypergraphs. A key step in our proof is to show that any balanced colorable hypergraph of average degree $d$ admits a proper balanced coloring with $r(r-1)d + 1$ colors. This extends a result of Feige and Kogan on bipartite graphs to this more general setting.

Explore related subjects

math.COcs.DM

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Abhishek Dhawan, Yuzhou Wang. 2025-04-06. Balanced colorings of Erdős-Rényi hypergraphs. https://arxiv.org/abs/2504.04585

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↗