On tournament inversion

DOI10.1002/JGT.23251MaRDI QIDQ6946052zbMATH OpenFDO

Authors Raphael Yuster

Publication date 7 August 2025

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1002/JGT.23251

zbMATH Keywords

inversiontournamenttriangle

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Cites work

• Asymptotic behavior of the chromatic index for hypergraphs
• Edge disjoint monochromatic triangles in 2-colored graphs
• Integer and fractional packing of families of graphs
• Integer and fractional packings in dense graphs
• Inversions in tournaments
• Invertibility of Digraphs and Tournaments
• Near perfect coverings in graphs and hypergraphs
• On a problem of K. Zarankiewicz
• On the Boolean dimension of a graph and other related parameters
• On the maximum cardinality of a consistent set of arcs in a random tournament
• Optimal ranking of tournaments
• Optimally ranking unrankable tournaments
• Packing triangles in a graph and its complement
• Problems, proofs, and disproofs on the inversion number
• Quasi-random tournaments
• The CRC handbook of combinatorial designs

Cited in

(1)

• Parameterized algorithms for k-inversion

This page was built for publication: On tournament inversion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6946052)