Circulant tournaments of prime order are tight

DOI10.1016/j.disc.2007.11.025zbMath1198.05083OpenAlexW1984108816MaRDI QIDQ998344

Víctor Neumann-Lara, Bernardo Llano

Publication date: 28 January 2009

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

Full work available at URL: https://doi.org/10.1016/j.disc.2007.11.025

zbMATH Keywords

sumsets3-coloringaddition theoremsacyclic disconnectioncirculant tournamenttight tournament

Mathematics Subject Classification ID

Trees (05C05) Directed graphs (digraphs), tournaments (05C20)

Related Items (7)

A family of bipartite circulant tournaments with acyclic disconnection 3 ⋮ Disproof of a conjecture of Neumann-Lara ⋮ The acyclic and \(\overset\rightarrow C_3\)-free disconnection of tournaments ⋮ On the acyclic disconnection of multipartite tournaments ⋮ The minimum feedback arc set problem and the acyclic disconnection for graphs ⋮ Tournaments and Semicomplete Digraphs ⋮ On the acyclic disconnection and the girth

Cites Work

• Unnamed Item
• Unnamed Item
• On multipartite tournaments
• The acyclic disconnection of a digraph
• Tight and untight triangulations of surfaces by complete graphs
• The Critical Pairs of Subsets of a Group of Prime Order
• On the minimum size of tight hypergraphs
• A class of tight circulant tournaments
• Cycles of Each Length in Regular Tournaments

This page was built for publication: Circulant tournaments of prime order are tight