On the public citation graph
Strong $K$-Transitive Oriented Graphs with Large Minimum Degree
0 signed · 20 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.1002/(sici)1097-0118(199609)23:1<43::aid-jgt4>3.0.co;2-kopenalex-extracted
Squaring a tournament: A proof of Dean's conjecture
inferredcites →https://doi.org/10.1002/jgt.20229openalex-extracted
Remarks on the second neighborhood problem
inferredcites →https://doi.org/10.1002/jgt.20634openalex-extracted
Seymour's Second Neighborhood Conjecture for Tournaments Missing a Generalized Star
inferredcites →https://doi.org/10.1002/jgt.21740openalex-extracted
Disjoint 3‐Cycles in Tournaments: A Proof of The Bermond–Thomassen Conjecture for Tournaments
inferredcites →https://doi.org/10.1007/978-3-319-71840-8_8openalex-extracted
Quasi-Transitive Digraphs and Their Extensions
inferredcites →https://doi.org/10.1016/j.dam.2020.06.011openalex-extracted
Seymour’s second neighborhood conjecture for 5-anti-transitive oriented graphs
inferredcites →https://doi.org/10.1016/j.dam.2020.12.026openalex-extracted
Seymour’s Second Neighborhood Conjecture for 6-antitransitive digraphs
inferredcites →https://doi.org/10.1016/j.dam.2021.08.011openalex-extracted
Seymour’s second neighborhood conjecture for m -free, k -transitive, k -anti-transitive digraphs and some approaches
inferredcites →https://doi.org/10.1016/j.dam.2021.12.034openalex-extracted
Extending some results on the second neighborhood conjecture
inferredcites →https://doi.org/10.1016/j.disc.2012.05.005openalex-extracted
k -kernels in k -transitive and k -quasi-transitive digraphs
inferredcites →https://doi.org/10.1016/j.disc.2015.02.012openalex-extracted
Vertex-disjoint cycles in bipartite tournaments
inferredcites →https://doi.org/10.1016/j.disc.2020.112127openalex-extracted
Vertex-disjoint cycles in local tournaments
inferredcites →https://doi.org/10.1137/080715792openalex-extracted
A Step toward the Bermond–Thomassen Conjecture about Disjoint Cycles in Digraphs
inferredcites →https://doi.org/10.7151/dmgt.1645openalex-extracted
4-transitive digraphs I: the structure of strong 4-transitive digraphs
inferredcites →https://doi.org/10.7151/dmgt.1765openalex-extracted
On the structure of strong k-transitive digraphs
inferredcites →https://doi.org/10.7151/dmgt.1922openalex-extracted
Some results on 4-transitive digraphs
inferredcites →https://doi.org/10.7494/opmath.2019.39.6.765openalex-extracted
Vertices with the second neighborhood property in Eulerian 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.