English

When all directed cycles have length three

Combinatorics 2025-02-11 v2

Abstract

We give a construction to build all digraphs with the property that every directed cycle has length three.

Cite

@article{arxiv.2410.13008,
  title  = {When all directed cycles have length three},
  author = {Paul Seymour},
  journal= {arXiv preprint arXiv:2410.13008},
  year   = {2025}
}
R2 v1 2026-06-28T19:24:55.756Z