2023/05/31 by Andrzej Grzesik, Justyna Jaworska, Grzesik, Andrzej +7
Computer Science · Mathematics · #05C20 #05C35 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #Limits and Structures in Graph Theory
paper · pdf · doi:10.48550/arxiv.2305.19959
openalex publication_date 2023/05/31 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
A classical Turán problem asks for the maximum possible number of edges in a graph of a given order that does not contain a particular graph H as a subgraph. It is well-known that the chromatic number of H is the graph parameter which describes the asymptotic behavior of this maximum. Here, we consider an analogous problem for oriented graphs, where compressibility plays the role of the chromatic number. Since any oriented graph having a directed cycle is not contained in any transitive tournament, it makes sense to consider only acyclic oriented graphs as forbidden subgraphs. We provide basic properties of the compressibility, show that the compressibility of acyclic oriented graphs with out-degree at most 2 is polynomial with respect to the maximum length of a directed path, and that the same holds for a larger out-degree bound if the Erdős-Hajnal conjecture is true. Additionally, generalizing previous results on powers of paths and arbitrary orientations of cycles, we determine the compressibility of acyclic oriented graphs with a restricted structure.