On the directions determined by Cartesian products and the clique number of generalized Paley graphs

From MaRDI portal
(Redirected from Publication:4991645)



Abstract: It is known that the number of directions formed by a Cartesian product AimesBsubsetAG(2,p) is at least |A||B|−min|A|,|B|+2, provided p is prime and |A||B|<p. This implies the best known upper bound on the clique number of the Paley graph over mathbbFp. In this paper, we extend this result to AG(2,q), where q is a prime power. We also give improved upper bounds on the clique number of generalized Paley graphs over mathbbFq. In particular, for a cubic Paley graph, we improve the trivial upper bound sqrtq to 0.769sqrtq+1. In general, as an application of our key result on the number of directions, for any positive function h such that h(x)=o(x) as xoinfty, we improve the trivial upper bound sqrtq to sqrtq−h(p) for almost all non-squares q.












This page was built for publication: On the directions determined by Cartesian products and the clique number of generalized Paley graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4991645)