Work

Counting Cliques in Finite Distant Graphs

Year: 2016
Type: preprint
Abstract: 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.
Language: English
Open Access status: green
OpenAlex ID: W2562583364
Cites: 3
Cited by: 1
Related to: 20