Counting odd cycle free orientations of graphs

MaRDI QIDQ6341931zbMATH OpenFDO

Authors Matija Bucić, Benny Sudakov

Publication date 2 June 2020

Abstract: In this short note we determine the maximum number, over all $n$-vertex graphs $G$, of orientations of $G$ containing no strongly connected cycle $C_{2k+1}$. This answers a part of a recent question of Araujo, Botler and Mota.

This page was built for publication: Counting odd cycle free orientations of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6341931)