IRREDUCIBLE TOURNAMENTS WITH THE MINIMUM NUMBER OF 3-CYCLES

Original Articles

IRREDUCIBLE TOURNAMENTS WITH THE MINIMUM NUMBER OF 3-CYCLES

Published in: Quaestiones Mathematicae
Volume 16 , issue 3 , 1993 , pages: 221–228
DOI: 10.1080/16073606.1993.9631734
Author(s): J.W. Moon Department of Mathematics, Canada
Keywords: 05C20
Download full text Get new issue alerts

Abstract

Burzio and Demaria have shown that when n≥4 there are 2n-4 irreducible tournaments T n with only n—2 3-cycles; another proof of this result is given.
« Editorial preface
A COHESION INDEX FOR COOPERATION GRAPHS »

Get new issue alerts for Quaestiones Mathematicae

Latest news

   more...

Latest articles

   more...