Counting Cliques in Finite Distant Graphs
  We state and prove some counting formulas relating to cliques in the distant graphs of projective lines over finite rings. As a preliminary to this, we prove a decomposition theorem for the graphs in terms of the direct-product decomposition of their rings. 
Tim Silverman
math.CO math.AG