Upper bounds on the size of transitive subtournaments in digraphs
Combinatorics
2016-05-10 v1
Abstract
In this paper, we consider upper bounds on the size of transitive subtournaments in a digraph. In particular, we give an analogy of Hoffman's bound for the size of cocliques in a regular graph. Furthermore, we partially improve the Hoffman type bound for doubly regular tournaments by using the technique of Greaves and Soicher for strongly regular graphs [4], which gives a new application of block intersection polynomials.
Keywords
Cite
@article{arxiv.1605.02469,
title = {Upper bounds on the size of transitive subtournaments in digraphs},
author = {Koji Momihara and Sho Suda},
journal= {arXiv preprint arXiv:1605.02469},
year = {2016}
}
Comments
9 pages