On the public citation graph

A rainbow version of Mantel's Theorem

https://doi.org/10.19086/aic.12043
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 points at this work

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

inferred← citeshttps://doi.org/10.1002/jgt.22966openalex-snapshot
Rainbow structures in a collection of graphs with degree conditions
inferred← citeshttps://doi.org/10.1002/jgt.23109openalex-snapshot
Minimum‐degree conditions for rainbow triangles
inferred← citeshttps://doi.org/10.1002/jgt.23224openalex-snapshot
Directed Graphs Without Rainbow Triangles
inferred← citeshttps://doi.org/10.1002/rsa.21189openalex-snapshot
On a rainbow extremal problem for color‐critical graphs
inferred← citeshttps://doi.org/10.1002/rsa.70005openalex-snapshot
On Rainbow Turán Densities of Trees
inferred← citeshttps://doi.org/10.1007/978-3-030-83823-2_134openalex-snapshot
A Rainbow Connectivity Threshold for Random Graph Families
inferred← citeshttps://doi.org/10.1007/s00373-022-02574-zopenalex-snapshot
From One to Many Rainbow Hamiltonian Cycles
inferred← citeshttps://doi.org/10.1007/s00493-024-00102-6openalex-snapshot
Rainbow Variations on a Theme by Mantel: Extremal Problems for Gallai Colouring Templates
inferred← citeshttps://doi.org/10.1007/s00493-024-00123-1openalex-snapshot
Hamilton Transversals in Tournaments
inferred← citeshttps://doi.org/10.1007/s11425-024-2469-2openalex-snapshot
Transversal Hamilton cycle in the hypergraph system
inferred← citeshttps://doi.org/10.1016/j.dam.2022.12.020openalex-snapshot
Sufficient conditions for properly colored C3 ’s and C4 ’s in edge-colored complete graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2022.113003openalex-snapshot
On a colored Turán problem of Diwan and Mubayi
inferred← citeshttps://doi.org/10.1016/j.disc.2024.113980openalex-snapshot
Vertex-bipancyclicity in a bipartite graph collection
inferred← citeshttps://doi.org/10.1016/j.disc.2024.114128openalex-snapshot
Spectral radius and rainbow Hamilton paths of a graph
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114506openalex-snapshot
Rainbow directed version of Dirac's theorem
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114600openalex-snapshot
Rainbow Hamiltonicity and the spectral radius
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.113771openalex-snapshot
Concentration of rainbow k-connectivity of a multiplex random graph
inferred← citeshttps://doi.org/10.1017/fms.2023.92openalex-snapshot
Rainbow spanning structures in graph and hypergraph systems
inferred← citeshttps://doi.org/10.1112/blms.12343openalex-snapshot
On a rainbow version of Dirac's theorem
inferred← citeshttps://doi.org/10.1112/blms.12896openalex-snapshot
A general approach to transversal versions of Dirac‐type theorems
inferred← citeshttps://doi.org/10.1112/blms.13223openalex-snapshot
Universality for transversal Hamilton cycles
inferred← citeshttps://doi.org/10.19086/aic.2022.3openalex-snapshot
Transversal factors and spanning trees
inferred← citeshttps://doi.org/10.37236/10571openalex-snapshot
Colored Unavoidable Patterns and Balanceable Graphs
inferred← citeshttps://doi.org/10.37236/12784openalex-snapshot
Directed Graphs Without Rainbow Stars
inferred← citeshttps://doi.org/10.37236/9489openalex-snapshot
Transversals and Bipancyclicity in Bipartite Graph Families
inferred← citeshttps://doi.org/10.3990/1.9789036558693openalex-snapshot
Properly colored subgraphs in edge-colored graphs
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.