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

Abstract

Thep-intersection graph of a collection of finite sets {S i } i=1 n is the graph with vertices 1, ...,n such thati, j are adjacent if and only if |S i ∩S j |≥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 graphK n,n andp≥2, then θ p (K n, n )≥(n 2+(2p−1)n)/p. Whenp=2, equality holds if and only ifK n has anorthogonal double covering, which is a collection ofn subgraphs ofK n , each withn−1 edges and maximum degree 2, such that each pair of subgraphs shares exactly one edge. By construction,K n has a simple explicit orthogonal double covering whenn is congruent modulo 12 to one of {1, 2, 5, 7, 10, 11}.