Heights in finite projective space, and a problem on directed graphs
Number Theory
2021-01-06 v1 Combinatorics
Abstract
Let . The \emph{height} of a point is Explicit formulas and estimates are obtained for the values of the height function in the case and these results are applied to the problem of determining the minimum number of edges the must be deleted from a finite directed graph so that the resulting subgraph is acyclic.
Keywords
Cite
@article{arxiv.math/0703418,
title = {Heights in finite projective space, and a problem on directed graphs},
author = {Melvyn B. Nathanson and Blair D. Sullivan},
journal= {arXiv preprint arXiv:math/0703418},
year = {2021}
}
Comments
10 pages