On the public citation graph
4-transitive digraphs I: the structure of strong 4-transitive digraphs
0 signed · 16 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
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.1080/00029890.1980.11995131openalex-snapshot
Robbins's Theorem for Mixed Multigraphs
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.1016/j.dam.2025.04.048openalex-snapshot
Some digraph classes that meet the directed path partition conjecture
inferred← citeshttps://doi.org/10.1016/j.dam.2025.08.014openalex-snapshot
Critical Kernel Imperfectness in 4-quasi-transitive digraphs and 4-anti-transitive digraphs of small diameter
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.2014.08.009openalex-snapshot
( k + 1 ) -kernels and the number of k -kings in k -quasi-transitive digraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2016.02.020openalex-snapshot
Hamiltonian paths in k -quasi-transitive digraphs
inferred← citeshttps://doi.org/10.47749/t/unicamp.2022.1247954openalex-snapshot
Path partition poblems in digraphs
inferred← citeshttps://doi.org/10.48550/arxiv.2006.06333openalex-snapshot
The structure of strong $k$-quasi-transitive digraphs with large diameters
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
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.