Counting orientations of graphs with no strongly connected tournaments

DOI10.1016/J.DISC.2022.113024zbMath1497.05121arXiv2101.12327OpenAlexW4289868095MaRDI QIDQ2675820

Carlos Hoppen, Guilherme Oliveira Mota, Fábio Botler

Publication date: 26 September 2022

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2101.12327

zbMATH Keywords

countingtournamentorientationcomplete graphstrongly connected

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Counting orientations of random graphs with no directed k‐cycles

Uses Software

• nauty
• SageMath
• Traces

Cites Work

• The number of Gallai \(k\)-colorings of complete graphs
• Edge colorings of graphs without monochromatic stars
• Edge-colorings of graphs avoiding complete graphs with a prescribed coloring
• Practical graph isomorphism. II.
• The number of oriantations having no fixed tournament
• A Rainbow Erdös--Rothschild Problem
• The Typical Structure of Gallai Colorings and Their Extremal Graphs
• The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques

This page was built for publication: Counting orientations of graphs with no strongly connected tournaments