DeepAI
Log In Sign Up

Counting orientations of graphs with no strongly connected tournaments

01/29/2021
by   Fábio Botler, et al.
0

Let S_k(n) be the maximum number of orientations of an n-vertex graph G in which no copy of K_k is strongly connected. For all integers n, k≥ 4 where n≥ 5 or k≥ 5, we prove that S_k(n) = 2^t_k-1(n), where t_k-1(n) is the number of edges of the n-vertex (k-1)-partite Turán graph T_k-1(n), and that T_k-1(n) is the only n-vertex graph with this number of orientations. Furthermore, S_4(4) = 40 and this maximality is achieved only by K_4.

READ FULL TEXT

page 1

page 2

page 3

page 4

12/26/2019

Twinless articulation points and some related problems

Let G=(V,E) be a twinless strongly connected graph. a vertex v∈ V is a t...
12/14/2021

A note on 2-vertex-connected orientations

We consider two possible extensions of a theorem of Thomassen characteri...
08/18/2022

Embeddable of one-vertex graph with rotations into torus

We are interested in finding combinatorial criteria for embedding graphs...
01/06/2022

BFS based distributed algorithm for parallel local directed sub-graph enumeration

Estimating the frequency of sub-graphs is of importance for many tasks, ...
10/26/2021

Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly

The Grundy number of a graph is the maximum number of colours used by th...
04/21/2021

QCSP on Reflexive Tournaments

We give a complexity dichotomy for the Quantified Constraint Satisfactio...
10/04/2021

An impossible utopia in distance geometry

The Distance Geometry Problem asks for a realization of a given weighted...