Circulant tournaments of prime order are tight

DOI10.1016/J.DISC.2007.11.025zbMATH Open1198.05083OpenAlexW1984108816MaRDI QIDQ998344FDOQ998344

Authors: Bernardo Llano, V. Neumann-Lara 

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

Recommendations

• A class of tight circulant tournaments
• Metacirculant tournaments whose order is a product of two distinct primes
• A conjecture on cycle-pancyclism in tournaments
• scientific article; zbMATH DE number 1998287
• A well-quasi-order for tournaments
• Tight bounds for powers of Hamilton cycles in tournaments
• Vertex-transitive tournaments of order a product of two distinct primes
• Existence of \(Z\)-cyclic triplewhist tournaments for a prime number of players
• On tournaments of small orders and their applications
• Pancyclic orderings of in-tournaments

zbMATH Keywords

3-coloringaddition theoremsacyclic disconnectionsumsetscirculant tournamenttight tournament

Mathematics Subject Classification ID

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

Cites Work

• Graph theory
• Title not available (Why is that?)
• Tight and untight triangulations of surfaces by complete graphs
• On the minimum size of tight hypergraphs
• The acyclic disconnection of a digraph
• A class of tight circulant tournaments
• The Critical Pairs of Subsets of a Group of Prime Order
• Cycles of Each Length in Regular Tournaments
• On multipartite tournaments

Cited In (11)

• The acyclic and \(\overset\rightarrow C_3\)-free disconnection of tournaments
• On the acyclic disconnection of multipartite tournaments
• Infinite families of tight regular tournaments
• On the acyclic disconnection and the girth
• A family of bipartite circulant tournaments with acyclic disconnection 3
• Tournaments and Semicomplete Digraphs
• Disproof of a conjecture of Neumann-Lara
• Bounds on the acyclic disconnection of a digraph
• The connection of the acyclic disconnection and feedback arc sets -- on an open problem of Figueroa et al..
• A class of tight circulant tournaments
• The minimum feedback arc set problem and the acyclic disconnection for graphs

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

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