Search arXivSearch

arXiv · 2008.04307

Spectrum of twists of Cayley and Cayley sum graphs

Abstract

Let $G$ be a finite group with $|G|\geq 4$ and $S$ be a subset of $G$. Given an automorphism $σ$ of $G$, the twisted Cayley graph $C(G, S)^σ$ (resp. the twisted Cayley sum graph $C_Σ(G, S)^σ$) is defined as the graph having $G$ as its set of vertices and the adjacent vertices of a vertex $g\in G$ are of the form $σ(gs)$ (resp. $σ(g^{-1} s)$) for some $s\in S$. If the twisted Cayley graph $C(G, S)^σ$ is undirected and connected, then we prove that the nontrivial spectrum of its normalised adjacency operator is bounded away from $-1$ and this bound depends only on its degree, the order of $σ$ and the vertex Cheeger constant of $C(G, S)^σ$. Moreover, if the twisted Cayley sum graph $C_Σ(G, S)^σ$ is undirected and connected, then we prove that the nontrivial spectrum of its normalised adjacency operator is bounded away from $-1$ and this bound depends only on its degree and the vertex Cheeger constant of $C_Σ(G, S)^σ$. We also study these twisted graphs with respect to anti-automorphisms, and obtain similar results. Further, we prove an analogous result for the Schreier graphs satisfying certain conditions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Arindam Biswas, Jyoti Prakash Saha. 2020-08-11. Spectrum of twists of Cayley and Cayley sum graphs. https://arxiv.org/abs/2008.04307

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

KEEP EXPLORING

Related papers

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

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

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