RUS  ENG
Full version
JOURNALS // Prikladnaya Diskretnaya Matematika // Archive

Prikl. Diskr. Mat., 2010 supplement № 3, Pages 72–73 (Mi pdm193)

Mathematical Foundations of Reliability of Computing and Control Systems

About one family of exact 2-extensions of tournaments

A. A. Dolgov

Saratov State University, Saratov

Abstract: Exact extensions were introduced by Harary and Hayes in 1996. Exact extensions are special case of minimal extensions of graphs and closely related to fault tolerance modeling. Only three families of graphs wich have exact $k$-extensions for every $k>0$ are known. In this paper we introduce new family of tournaments that have exact 1- and 2-extensions, but have no 3-extension.

UDC: 519.17



© Steklov Math. Inst. of RAS, 2026