Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2609.25128

Sub-quorum colorings of graphs

Rafik Sahbi
View original source ↗Read source document ↗Export metadata ↓

Abstract

A sub-quorum coloring is a partial vertex coloring in which every colored vertex sees at least half of its colored closed neighborhood in its own color. The notion was proposed by Hedetniemi, Hedetniemi, Laskar and Mulder as an open direction in their foundational work on quorum colorings. We further develop the study of the sub-quorum coloring number $\psq(G)$ introduced by Hedetniemi, Hedetniemi, Laskar and Mulder. Our emphasis is on structural bounds, computational complexity, grid graphs and hypercubes. We establish general bounds, relate $\psq$ to $2$-independence, discuss computational complexity, determine exact values for several classical families, and give exact and computer-assisted results for grid strips. We also investigate hypercubes. In particular, exact certificates for $Q_n$, $2\le n\le6$, give $\psq(Q_n)=\bii(Q_n)=2^{n-1}$, and we formulate the general equality as a conjecture. The computational claims use integer arithmetic and are independently reproducible by the verifier accompanying the manuscript.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Rafik Sahbi. 2026-09-20. Sub-quorum colorings of graphs. https://arxiv.org/abs/2609.25128

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

KEEP EXPLORING

Related papers

arXiv2026

On nut graphs with two vertex and three edge orbits

Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Bašić, Fowler and Pisanski proved that the automorphism group of a nut graph has more orbits on the edge set than on the vertex set. They classified all orders for which a vertex-transitive nut graph with precisely two edge orbits exists, and conjectured that a nut graph with two vertex and three edge orbits exists for each non-prime order $n \ge 9$. Motivated by this conjecture, we introduce a very general construction that provides graphs with the desired symmetry properties, and we determine some sufficient spectral and structural conditions under which they are nut graphs. The construction yields infinite families of examples and confirms the above conjecture for all odd non-prime orders up to $2\,500$ and for at least $99.8$ percent of all odd non-prime orders up to a million. Finally, we present some additional interesting examples of nut graphs with two vertex and three edge orbits that do not arise from this construction.

math.CO↗
arXiv2026

On vertex-minimal simplicial maps to the sphere

For positive integers $n,d$, let $λ(n,d)$ be the minimal number of vertices of a triangulation of the $n$-sphere which admits a degree $d$ simplicial map onto the boundary of the $(n+1)$-simplex. We show that for $h=\lfloor\frac{n+1}2\rfloor$, the function $λ(n,d)^h$ has linear order of growth in $d$, answering a question of O. Musin. All triangulations we obtained are isomorphic to boundaries of convex polytopes in $\mathbb{R}^{n+1}$.

math.CO↗