arXiv Analytics

Sign in

arXiv:2109.03654 [math.CO]AbstractReferencesReviewsResources

Triple intersection numbers for the Paley graphs

Andries E. Brouwer, William J. Martin

Published 2021-09-08Version 1

We give a tight bound for the triple intersection numbers of Paley graphs. In particular, we show that any three vertices have a common neighbor in Paley graphs of order larger than 25.

Comments: 3 pages
Categories: math.CO
Subjects: 05E30, 11T99
Related articles: Most relevant | Search more
arXiv:1804.05513 [math.CO] (Published 2018-04-16)
A Tight Bound for Hypergraph Regularity II
arXiv:1809.07553 [math.CO] (Published 2018-09-20)
On tight $4$-designs in Hamming association schemes
arXiv:2205.14556 [math.CO] (Published 2022-05-29)
Tight bounds on a conjecture of Gallai

Links

Toolbox