The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Let TTn be a transitive tournament on n vertices. It is known Görlich, Pilśniak, Woźniak, (2006) [3] that for any acyclic oriented graph G⃗ of order n and size not greater than 34(n−1), two graphs isomorphic to G⃗ are arc-disjoint subgraphs of TTn. In this paper, we consider the problem of embedding of acyclic oriented graphs into their complements in transitive tournaments. We show that any acyclic...
We prove that every digraph of order n and size at most 74n-81 is embeddable in its complement. Moreover, for such digraphs there are embeddings without fixed points.
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.