When all directed cycles have length three

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

Authors

Paul Seymour (ORCID: https://orcid.org/0000-0003-0067-4534)

Institutions

Princeton University (US)

Publication Details

Journal: European Journal of Combinatorics
Published: 2025-04-26
DOI: https://doi.org/10.1016/j.ejc.2025.104161
Primary Topic: graph theory and CDMA systems
Type: article
Field-Weighted Citation Impact: 0.00

Funders

National Science Foundation
Air Force Office of Scientific Research

Controls

|||

ALL TIME

JAN

FEB

MAR

APR

MAY

JUN

JUL

AUG

SEP

OCT

article

When all directed cycles have length three

Paul Seymour

Apr 26, 2025

European Journal of Combinatorics

graph theory and CDMA systems

article

When all directed cycles have length three

Paul Seymour

April 26, 2025article en

Abstract

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

European Journal of CombinatoricsVol. 127

Princeton University (US)

National Science Foundation, Air Force Office of Scientific Research

Openalex Percentile: Top 93%

graph theory and CDMA systems

DOI Open Access PDF OpenAlex

AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

When all directed cycles have length three — Paul Seymour · European Journal of Combinatorics (2025) | TGRS Research Map | TGRS