On the public citation graph

3-transitive digraphs

0 signed · 26 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/jgt.3190200205openalex-snapshot
Quasi‐transitive digraphs
inferredcites →https://doi.org/10.1006/jctb.1993.1069openalex-snapshot
In-Tournament Digraphs
inferredcites →https://doi.org/10.1007/978-1-4471-3886-0openalex-snapshot
Digraphs Theory Algorithms And Applications
inferredcites →https://doi.org/10.1016/j.disc.2005.12.031openalex-snapshot
Perfect graphs, kernels, and cores of cooperative games
inferredcites →https://doi.org/10.1016/j.disc.2009.06.033openalex-snapshot
The structure of strong arc-locally in-semicomplete digraphs
inferredcites →https://doi.org/10.1016/j.disc.2010.06.008openalex-snapshot
On the structure of strong 3-quasi-transitive digraphs
inferredcites →https://doi.org/10.1016/j.disc.2010.11.009openalex-snapshot
Independent sets and non-augmentable paths in arc-locally in-semicomplete digraphs and quasi-arc-transitive digraphs
inferredcites →https://doi.org/10.1016/j.disc.2012.05.005openalex-snapshot
k -kernels in k -transitive and k -quasi-transitive digraphs
inferredcites →https://doi.org/10.1016/j.endm.2009.07.010openalex-snapshot
A classification of arc-locally semicomplete digraphs
inferredcites →https://doi.org/10.1090/mbk/121/32openalex-snapshot
Theory of games and economic behavior
inferredcites →https://doi.org/10.1215/00182702-38-1-189openalex-snapshot
Theory of Games and Economic Behavior

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4494891openalex-extracted
Strong $K$-Transitive Oriented Graphs with Large Minimum Degree
inferred← citeshttps://doi.org/10.1007/978-3-319-71840-8_8openalex-snapshot
Quasi-Transitive Digraphs and Their Extensions
inferred← citeshttps://doi.org/10.1007/s00373-013-1367-zopenalex-snapshot
On Panchromatic Digraphs and the Panchromatic Number
inferred← citeshttps://doi.org/10.1007/s00454-011-9379-zopenalex-snapshot
A Generalisation of Tverberg’s Theorem
inferred← citeshttps://doi.org/10.1016/j.disc.2012.01.011openalex-snapshot
A conjecture on k -transitive digraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2012.05.005openalex-snapshot
k -kernels in k -transitive and k -quasi-transitive digraphs
inferred← citeshttps://doi.org/10.4236/apm.2015.512066openalex-snapshot
On k-Transitive Closures of Directed Paths
inferred← citeshttps://doi.org/10.48550/arxiv.1412.7264openalex-snapshot
On $k$-transitive closures of directed paths
inferred← citeshttps://doi.org/10.7151/dmgt.1546openalex-snapshot
k-kernels in generalizations of transitive digraphs
inferred← citeshttps://doi.org/10.7151/dmgt.1645openalex-snapshot
4-transitive digraphs I: the structure of strong 4-transitive digraphs
inferred← citeshttps://doi.org/10.7151/dmgt.1680openalex-snapshot
Underlying graphs of 3-quasi-transitive digraphs and 3-transitive digraphs
inferred← citeshttps://doi.org/10.7151/dmgt.1765openalex-snapshot
On the structure of strong k-transitive digraphs
inferred← citeshttps://doi.org/10.7151/dmgt.1787openalex-snapshot
(k-1)-kernels in strong k-transitive digraphs
inferred← citeshttps://doi.org/10.7151/dmgt.1922openalex-snapshot
Some results on 4-transitive digraphs
inferred← citeshttps://doi.org/10.7151/dmgt.2463openalex-snapshot
$(k,H)$-kernels in nearly tournaments
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.