Thep-intersection number of a complete bipartite graph and orthogonal double coverings of a clique

Thep-intersection graph of a collection of finite sets {Si}i=1n is the graph with vertices 1, ...,n such thati, j are adjacent if and only if |Si∩Sj|≥p. Thep-intersection number of a graphG, herein denoted θp(G), is the minimum size of a setU such thatG is thep-intersection graph of subsets ofU. IfG is the complete bipartite graphKn,n andp≥2, then θp(Kn, n)≥(n2+(2p−1)n)/p. Whenp=2, equality holds if and only ifKn has anorthogonal double covering, which is a collection ofn subgraphs ofKn, each withn−1 edges and maximum degree 2, such that each pair of subgraphs shares exactly one edge. By construction,Kn has a simple explicit orthogonal double covering whenn is congruent modulo 12 to one of {1, 2, 5, 7, 10, 11}.