Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.13852

Clique and chromatic numbers of graph powers: spectral bounds and anticodes

Aida Abiad·Gabriel Coutinho·Hitesh Kumar·Emanuel Juliano·Michael Tait
View original source ↗Read source document ↗Export metadata ↓

Abstract

Using spectral and polynomial methods, we show several sharp spectral bounds for the clique and chromatic numbers of graph powers that only use spectral information from the original graph. In particular, we strengthen earlier spectral-radius estimates to obtain an asymptotically sharp colouring bound for general graph powers, and prove a sharp bound for powers of line graphs with a complete characterisation of equality. We also develop polynomial methods yielding upper and lower bounds for clique numbers of graph powers. Regarding the connection between the clique and coloring parameters of graph powers, we propose a spectral analogue of Wegner's conjecture, determine the extremal values for graph squares, and establish the conjecture for all powers when the spectral-radius bound is sufficiently small. Finally, we connect our spectral polynomial method with coding theory: we prove that for distance-regular graphs, optimisation over the adjacency algebra recovers Delsarte's linear programming bound for anticodes.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Aida Abiad, Gabriel Coutinho, Hitesh Kumar, Emanuel Juliano, Michael Tait. 2026-10-09. Clique and chromatic numbers of graph powers: spectral bounds and anticodes. https://arxiv.org/abs/2610.13852

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

KEEP EXPLORING

Related papers

arXiv2026

4-cycle-free induced subgraphs of grid graphs

In this paper we consider sets $S$ of vertices of the $n \times n$ grid graph $G_n$ where the induced subgraph $G_S$ having vertex set $S$ contains no $4$-cycles. We first quickly establish the maximum size of any such induced subgraph. Then, for even $n$ we estimate the number of $4$-cycle-free induced subgraphs of maximum and near-maximum size. If ${\mathcal F}_\varepsilon$ denotes the family of $4$-cycle-free induced subgraphs with at least $(3/4-\varepsilon)n^2$ vertices, then we show $$ \log|{\mathcal F}_0|=(1+o(1))n\log n. $$ Then, we also establish exponential upper and lower bounds for $|{\mathcal F}_\varepsilon|$. This estimate is proved using a local letter-pattern encoding of the unique missing vertex in a set of $2\times2$ blocks that tile the grid; the upper bound for $|{\mathcal F}_\varepsilon|$ uses a coarser block tiling (using larger blocks). We discuss the problem of closing the gap between our upper and lower bounds for $|{\mathcal F}_\varepsilon|$, and a possible defect-container approach.

math.CO↗
arXiv2026

The size-Ramsey numbers of $k$-uniform relaxed $\ell$-trees

The size-Ramsey number $\widehat{R}_k(\mathcal G)$ of a $k$-uniform hypergraph $\mathcal G$ is the minimum number of edges in a $k$-uniform hypergraph $\mathcal H$ such that every $2$-edge-coloring of $\mathcal H$ contains a monochromatic copy of $\mathcal G$. Fox asked whether, for fixed $2\le \ell 0$ depends only on $k$ and $\ell$. Moreover, any two distinct edges of the construction intersect in at most $2\ell-k-1$ vertices. In contrast, for $k\ge 2\ell$, we prove that every $k$-uniform relaxed $\ell$-tree $\bar{\mathcal T}_{n,\ell}^{(k)}$ on $n$ vertices satisfies \[ \widehat{R}_k\bigl(\bar{\mathcal T}_{n,\ell}^{(k)}\bigr) =O_{k,\ell}(n^{2k}). \]

math.CO↗
arXiv2026

A framework for spanning forest identities

Identities of spanning forest polynomials can come from determinantal identities such as the classical Dodgson identity. They can also be useful in quantum field theory calculations, particularly the quadratic ones. To better understand the structure of spanning forest polynomial identities, we look at when identities on a given graph are generic for all graphs, we ask about dimensions of spaces of spanning forest identities indexed by certain parameters, and we set up a framework that we hope will be helpful for further progress in these directions. As part of this framework, we identify a family of maps naturally given by the all-minors matrix-tree theorem, and we show that their ranks are counted by the Narayana numbers via explicit construction of bases.

math.CO↗