On the public citation graph

Chromatic Graphs, Ramsey Numbers and the Flexible Atom Conjecture

0 signed · 14 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.1007/bf01182249openalex-snapshot

Combinatorial aspects of relations

inferredcites →https://doi.org/10.1007/bf01190770openalex-snapshot

Small representations of the relation algebra ?n+1(1, 2, 3)

inferredcites →https://doi.org/10.1007/bf01221799openalex-snapshot

A perspective on the theory of relation algebras

inferredcites →https://doi.org/10.1307/mmj/1028998510openalex-snapshot

Relation algebras and projective geometries.

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-031-28083-2_2openalex-snapshot

Comer Schemes, Relation Algebras, and the Flexible Atom Conjecture

inferred← citeshttps://doi.org/10.1007/978-3-031-68279-7_2openalex-snapshot

Cyclic Group Spectra for Some Small Relation Algebras

inferred← citeshttps://doi.org/10.1007/s00012-018-0570-4openalex-snapshot

Finite representations for two small relation algebras

inferred← citeshttps://doi.org/10.1007/s00012-022-00791-4openalex-snapshot

Improved bounds on the size of the smallest representation of relation algebra $$32_{65}$$

inferred← citeshttps://doi.org/10.1007/s00012-026-00927-wopenalex-snapshot

Monk algebras and representability

inferred← citeshttps://doi.org/10.1142/s0218196723500595openalex-snapshot

Directed Ramsey and anti-Ramsey schemes and the Flexible Atom Conjecture

inferred← citeshttps://doi.org/10.1142/s0218196726500013openalex-snapshot

Network satisfaction problems solved by k -consistency

inferred← citeshttps://doi.org/10.1609/aaai.v35i7.16773openalex-snapshot

Network Satisfaction for Symmetric Relation Algebras with a Flexible Atom

inferred← citeshttps://doi.org/10.1613/jair.1.14195openalex-snapshot

The Complexity of Network Satisfaction Problems for Symmetric Relation Algebras with a Flexible Atom

inferred← citeshttps://doi.org/10.31274/etd-180810-2245openalex-snapshot

Coloring and extremal problems in combinatorics

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.