Counting odd cycle free orientations of graphs
Combinatorics
2020-06-03 v1
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.
Keywords
Cite
@article{arxiv.2006.01670,
title = {Counting odd cycle free orientations of graphs},
author = {M. Bucić and B. Sudakov},
journal= {arXiv preprint arXiv:2006.01670},
year = {2020}
}
Comments
4 pages