Abstract
For a prime and a positive integer , let . Let be a primitive element of the finite field . The Peisert graph is defined as the graph with vertex set where is an edge if and only if . We provide a formula, in terms of finite field hypergeometric functions, for the number of complete subgraphs of order four contained in . We also give a new proof for the number of complete subgraphs of order three contained in by evaluating certain character sums. The computations for the number of complete subgraphs of order four are quite tedious, so we further give an asymptotic result for the number of complete subgraphs of any order in Peisert graphs.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.