Abstract
We provide a new family of Kk-free pseudorandom graphs with edge density Θ(n−1/(k−1)), matching a recent construction due to Bishnoi, Ihringer and Pepe [2]. As in the former result, the idea is to use large subgraphs of polarity graphs, which are defined over a finite field Fq. While their construction required q to be odd, we will give the first construction with q a power of 2.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
