Related papers: Paley-like graphs over finite fields from vector s…

We describe a new class of maximal cliques, with a vector space structure, of Cayley graphs defined on the additive group of a field. In particular, we show that in the cubic Paley graph with order $q^3$, the subfield with $q$ elements…

We derive an asymptotic formula for the number of solutions in a given subfield to certain system of equations over finite fields. As an application, we construct new families of maximal cliques in generalized Paley graphs. Given integers…

Infinite analogues of the Paley graphs are constructed, based on uncountably many infinite but locally finite fields. Weil's estimate for character sums shows that they are all isomorphic to the random or universal graph of Erd\H os,…

Let $GP(q,d)$ be the $d$-Paley graph defined on the finite field $\mathbb{F}_q$. It is notoriously difficult to improve the trivial upper bound $\sqrt{q}$ on the clique number of $GP(q,d)$. In this paper, we investigate the connection…

The Paley graph is a well-known self-complementary pseudo-random graph, defined over a finite field of odd order. We describe an attempt at an analogous construction using fields of even order. Some properties of the graph are noted, such…

We show the maximality of subfields as cliques in a special family of Cayley graphs defined on the additive group of a finite field. In particular, this confirms a conjecture of Yip on generalized Paley graphs.

In this paper we introduce a graph structure, called subspace sum graph $\mathcal{G}(\mathbb{V})$ on a finite dimensional vector space $\mathbb{V}$ where the vertex set is the collection of non-trivial proper subspaces of a vector space and…

To construct a Paley graph, we fix a finite field and consider its elements as vertices of the Paley graph. Two vertices are connected by an edge if their difference is a square in the field. We will study some important properties of the…

Let $k \geq 2$ be an integer. Let $q$ be a prime power such that $q \equiv 1 \pmod {k}$ if $q$ is even, or, $q \equiv 1 \pmod {2k}$ if $q$ is odd. The generalized Paley graph of order $q$, $G_k(q)$, is the graph with vertex set…

Consider the family of all finite graphs with maximum degree $\Delta(G)<d$ and matching number $\nu(G)<m$. In this paper we give a new proof to obtain the exact upper bound for the number of edges in such graphs and also characterize all…

Finding a reasonably good upper bound for the clique number of Paley graphs is an open problem in additive combinatorics. A recent breakthrough by Hanson and Petridis using Stepanov's method gives an improved upper bound on Paley graphs…

Let $q$ be a prime power such that $q\equiv 1\pmod{4}$. The Paley graph of order $q$ is the graph with vertex set as the finite field $\mathbb{F}_q$ and edges defined as, $ab$ is an edge if and only if $a-b$ is a non-zero square in…

Several discrete geometry problems are equivalent to estimating the size of the largest homogeneous sets in graphs that happen to be the union of few comparability graphs. An important observation for such results is that if $G$ is an…

Let $n=2^s p_{1}^{\alpha_{1}}\cdots p_{k}^{\alpha_{k}}$, where $s=0$ or $1$, $\alpha_i\geq 1$, and the distinct primes $p_i$ satisfy $p_i\equiv 1\pmod{4}$ for all $i=1, \ldots, k$. Let $\mathbb{Z}_n^\ast$ denote the group of units in the…

Let $q$ be an odd prime power, let $n\ge 2$, and let $V\subsetneq \mathbb F_{q^n}$ be a proper $\mathbb F_q$-vector subspace. Given a nonzero quadratic form $Q(X,Y)\in \mathbb F_{q^n}[X,Y]$, we consider the graph $\Gamma(Q,V)$ that…

Paley graphs and Paley sum graphs are classical examples of quasi-random graphs. In this paper, we provide new constructions of families of quasi-random graphs that behave like Paley graphs but are neither Cayley graphs nor Cayley sum…

We show that large subsets of vector spaces over finite fields determine certain point configurations with prescribed distance structure. More specifically, we consider the complete graph with vertices as the points of $A \subseteq…

There is a conjecture that the second largest maximal cliques in Paley graphs of square order $P(q^2)$ have size $\frac{q+\epsilon}{2}$, where $q \equiv \epsilon \pmod 4$, and split into two orbits under the full group of automorphisms…

For a finite group $G$, the proper power graph $\mathscr{P}^*(G)$ of $G$ is the graph whose vertices are non-trivial elements of $G$ and two vertices $u$ and $v$ are adjacent if and only if $u \neq v$ and $u^m=v$ or $v^m=u$ for some…

We determine new upper bounds for the clique numbers of strongly regular graphs in terms of their parameters. These bounds improve on the Delsarte bound for infinitely many feasible parameter tuples for strongly regular graphs, including…