Quasi‐carousel tournaments

DOI10.1002/jgt.22205zbMath1391.05123arXiv1503.04124OpenAlexW2963921322MaRDI QIDQ4575526

Leonardo Nagami Coregliano

Publication date: 13 July 2018

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

tournamentsextremal problemsflag algebraquasi-randomness

Mathematics Subject Classification ID

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

Related Items (2)

Strongly polynomial sequences as interpretations ⋮ On the maximum density of fixed strongly connected subtournaments

This page was built for publication: Quasi‐carousel tournaments