Tighter bounds on directed Ramsey number \(R(7)\)

DOI10.1007/s00373-022-02560-5zbMath1497.05171arXiv2011.00683OpenAlexW3095853283MaRDI QIDQ2676760

Marijn J. H. Heule, David Neiman, John Mackey

Publication date: 28 September 2022

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

Ramsey theorytournamentssatisfiabilityencoding

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Ramsey theory (05D10) Directed graphs (digraphs), tournaments (05C20)

Uses Software

• MiniSat
• Plingeling
• Treengeling
• Lingeling

Cites Work

• Unnamed Item
• On tournaments and their largest transitive subtournaments
• On tournaments free of large transitive subtournaments
• Semidefinite Programming and Ramsey Numbers
• Theory and Applications of Satisfiability Testing

This page was built for publication: Tighter bounds on directed Ramsey number \(R(7)\)