Abstract
In this short note we determine the maximum number, over all -vertex graphs , of orientations of containing no strongly connected cycle . This answers a part of a recent question of Araujo, Botler and Mota.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.