Invertibility of Digraphs and Tournaments

DOI10.1137/23m1547135arXiv2212.11969WikidataQ129995947 ScholiaQ129995947MaRDI QIDQ6141864

Emil Powierski, Noga Alon, Elizabeth L. Wilmer, Alexander D. Scott, Unnamed Author

Publication date: 23 January 2024

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

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

zbMATH Keywords

digraphstournamentsinversion numberdecycling setdijoin operation

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fundamentals of parameterized complexity
• On the maximum cardinality of a consistent set of arcs in a random tournament
• Inversions in tournaments
• Boolean designs and self-dual matroids
• Optimally ranking unrankable tournaments
• Transforming cabbage into turnip
• On Subsets with Intersections of Even Cardinality
• The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments
• Tournament Ranking with Expected Profit in Polynomial Time
• Structure theorem for tournaments omitting N₅
• Genome Rearrangements and Sorting by Reversals
• Reducibility among Combinatorial Problems
• On the Boolean dimension of a graph and other related parameters
• Feedback Arc Set
• Ranking Tournaments
• Transitiv orientierbare Graphen
• Orthogonal Matrices Over Finite Fields
• Optimal ranking of tournaments

This page was built for publication: Invertibility of Digraphs and Tournaments