23 citations · 121 across the 26 of their papers we have counts for
15 papers · 1 filter
Cliques in Paley graphs of square order and in Peisert graphs
Andries E. Brouwer, Sergey Goryainov, Leonid Shalaginov +1
We study maximal cliques in the collinearity graphs of Desarguesian nets, give some structural results and some numerical information. In particular, we show for Desarguesian nets…
Avoiding short progressions in Euclidean Ramsey theory
Gabriel Currier, Kenneth Moore, Chi Hoi Yip
We provide a general framework to construct colorings avoiding short monochromatic arithmetic progressions in Euclidean Ramsey theory. Specifically, if denotes colline…
Any two-coloring of the plane contains monochromatic 3-term arithmetic progressions
Gabriel Currier, Kenneth Moore, Chi Hoi Yip
A conjecture of Erdős, Graham, Montgomery, Rothschild, Spencer and Straus states that, with the exception of equilateral triangles, any two-coloring of the plane will have a monoch…
Extremal Peisert-type graphs without the strict-EKR property
Sergey Goryainov, Chi Hoi Yip
It is known that Paley graphs of square order have the strict-EKR property, that is, all maximum cliques are canonical cliques. Peisert-type graphs are natural generalizations of P…
An exponential bound for simultaneous embeddings of planar graphs
Ritesh Goenka, Pardis Semnani, Chi Hoi Yip
We show that there are planar graphs on vertices which do not admit a simultaneous straight-line embedding on any -point set in the plane. In particula…
Exact values and improved bounds on the clique number of cyclotomic graphs
Chi Hoi Yip
Let be an odd power of a prime , and such that and . We show that the clique number of the Cayley graph $\operator…