Counting Cliques in Finite Distant Graphs
Combinatorics
2016-12-26 v1 Algebraic Geometry
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.
Keywords
Cite
@article{arxiv.1612.08085,
title = {Counting Cliques in Finite Distant Graphs},
author = {Tim Silverman},
journal= {arXiv preprint arXiv:1612.08085},
year = {2016}
}
Comments
16 pages