A clique-free pseudorandom subgraph of the pseudo polarity graph

Sam Mattheus, Francesco Pavese

Onderzoeksoutput: Articlepeer review

Samenvatting

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.

Originele taal-2English
Artikelnummer112871
Aantal pagina's7
TijdschriftDiscrete Mathematics
Volume345
Nummer van het tijdschrift7
DOI's
StatusPublished - jul 2022

Vingerafdruk

Duik in de onderzoeksthema's van 'A clique-free pseudorandom subgraph of the pseudo polarity graph'. Samen vormen ze een unieke vingerafdruk.

Citeer dit