Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2603.18289

Counting Strict Gridlock on Graphs

Matthew I. Jones·Zachary Winkeler
View original source ↗Read source document ↗Export metadata ↓

Abstract

Graph colorings have been of interest to mathematicians for a long time, but relatively recently, social scientists have also found them to be interesting tools for studying group behavior. In the last 20 years, scientists have begun to study how coloring problems can be solved by groups of individuals on a graph, which has led to new insights into network structure, group dynamics, and individual human behavior. Despite this newfound utility, the exact nature of these distributed coloring problems is not well-understood, and established mathematical tools like the chromatic polynomial miss the unique challenges that arise in these social problem-solving situations with limited information. In this paper, we provide a new framework for understanding these distributed problems by defining a new kind of graph coloring with particular relevance to consensus formation on networks, in which all vertices are trying to agree on a common color. These strict gridlock colorings represent roadblocks to consensus where the group will not reach a uniform coloring using natural update processes. We describe a recurrence relation that provides an algorithm for counting these gridlocked colorings, which establishes a mathematical measure of how much a given graph hinders consensus in a group.

Explore related subjects

math.COphysics.soc-ph

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Matthew I. Jones, Zachary Winkeler. 2026-03-18. Counting Strict Gridlock on Graphs. https://arxiv.org/abs/2603.18289

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

KEEP EXPLORING

Related papers

arXiv2026

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO↗
arXiv2026

Random algebraic constructions for extremal and Ramsey problems

Building on Bukh's random algebraic method, we develop a framework for extremal and Ramsey problems involving apex hypergraphs. If $\mathcal{H}$ is a $(d-1)$-partite $(d-1)$-uniform hypergraph with $S$ edges and $\mathcal{H}(t)$ is obtained by adjoining $t$ vertices with common link $\mathcal{H}$, we prove that $\operatorname{ex}(n,\mathcal{H}(t))=Ω_{\mathcal{H}}(n^{d-1/S})$ for $t>9^{S+o_d(S)}$, which is best possible when $\mathcal{H}$ is Sidorenko. Our framework also yields sharper sided Zarankiewicz bounds, quantitative generalized Tur'an bounds, and diagonal multicolor Ramsey constructions. For each fixed $s\geq 2$ and $K\geq 3$, we further prove $\operatorname{r}_K(\mathcal K_{s,t};\mathcal K_n) =Θ_{s,t,K}((n/\log n)^s)$ for $t>9^{s+o(s)}$, extending a theorem of Alon and Rödl from factorial to exponential $t$. The main ingredients are interpolation on $m$-independent varieties, control of the dependencies imposed by symmetry, and linear spaces of forms whose nonzero members remain regular after a common algebraic slice. Limited edge independence then gives the spectral and local-density estimates needed for the Ramsey application.

math.CO↗
arXiv2026

A note on vertex-critical induced subgraphs of shift graphs

Shift graphs, introduced by Erdős and Hajnal in 1964, form one of the simplest known non-recursive constructions of triangle-free graphs with arbitrarily large chromatic number. In this note, we identify a surprising property: for each integer $k \geq 1$, the smallest $k$-chromatic shift graph contains a \emph{unique} induced $k$-vertex-critical subgraph. We give an explicit description of this subgraph and prove its uniqueness. This provides a new family of vertex-critical triangle-free graphs of arbitrarily large chromatic number.

math.CO↗