1 citations · 3 across the 6 of their papers we have counts for
6 papers
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…
A construction of directed strongly regular graphs with parameters (63,11,8,1,2)
Andries E. Brouwer, Dean Crnković, Andrea Švob
In this paper, we prove the existence of directed strongly regular graphs with parameters . We construct a pair of nonisomorphic dsrg(63,11,8,1,2), where one is obta…
Some locally Kneser graphs
A. E. Brouwer
The Kneser graph is the graph on the -subsets of an -set, adjacent when disjoint. Clearly, is locally . Hall showed for that there ar…
The equivalence of two inequalities for quasisymmetric designs
A. E. Brouwer
It has been an open problem whether Hobart's inequality on the parameters of a quasisymmetric 2-design is independent of earlier known restrictions. In this note we show that it is…
Counterexamples to conjectures about Subset Takeaway and counting linear extensions of a Boolean lattice
Andries E. Brouwer, J. Daniel Christensen
We develop an algorithm for efficiently computing recursively defined functions on posets. We illustrate this algorithm by disproving conjectures about the game Subset Takeaway (Ch…
Distance-regular graphs where the distance- graph has fewer distinct eigenvalues
A. E. Brouwer, M. A. Fiol
Let the Kneser graph of a distance-regular graph be the graph on the same vertex set as , where two vertices are adjacent when they have maximal distance in . We stud…