On the public citation graph
A category-theoretical approach to hypergraphs
0 signed · 45 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.1007/978-1-4612-9839-7openalex-snapshot
Categories for the Working Mathematician
inferredcites →https://doi.org/10.1007/bf01894680openalex-snapshot
On chromatic number of finite set-systems
inferredcites →https://doi.org/10.1016/0095-8956(75)90042-8openalex-snapshot
Hypermaps versus bipartite maps
inferredcites →https://doi.org/10.1049/el:19760159openalex-snapshot
Products of graph projections as a model for multistage communication networks
inferredcites →https://doi.org/10.1111/j.1749-6632.1979.tb17773.xopenalex-snapshot
AN INTRODUCTION TO THE CATEGORY OF GRAPHS*
inferredcites →https://doi.org/10.1111/j.1749-6632.1979.tb32788.xopenalex-snapshot
MULTIPLE COVERS OF HYPERGRAPHS
inferredcites →https://doi.org/10.4153/cjm-1977-027-1openalex-snapshot
Kronecker Products and Local Joins of Graphs
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.4838996openalex-extracted
Positive Controllability and Hypergraphs
inferred← citeshttps://doi.org/10.1002/jgt.20609openalex-snapshot
The Cartesian product of hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-030-67318-5_25openalex-snapshot
Hypernetwork Science: From Multidimensional Networks to Computational Topology
inferred← citeshttps://doi.org/10.1007/s00373-023-02672-6openalex-snapshot
Homotopy and Hom Construction in the Category of Finite Hypergraphs
inferred← citeshttps://doi.org/10.1007/s10485-026-09852-4openalex-snapshot
A Categorical Approach to Additive Combinatorics
inferred← citeshttps://doi.org/10.1007/s10801-023-01232-8openalex-snapshot
Incidence hypergraphs: the categorical inconsistency of set-systems and a characterization of quiver exponentials
inferred← citeshttps://doi.org/10.1007/s11565-026-00741-1openalex-snapshot
On two new types of Moore subcategories
inferred← citeshttps://doi.org/10.1007/s11786-012-0109-6openalex-snapshot
A Survey on Hypergraph Products
inferred← citeshttps://doi.org/10.1007/s41468-023-00142-9openalex-snapshot
Hypergraph co-optimal transport: metric and categorical properties
inferred← citeshttps://doi.org/10.1007/s41468-025-00227-7openalex-snapshot
A survey of simplicial, relative, and chain complex homology theories for hypergraphs
inferred← citeshttps://doi.org/10.1007/s41468-025-00228-6openalex-snapshot
Stability and extension of steady and ranging persistence
inferred← citeshttps://doi.org/10.1016/j.jcta.2016.05.002openalex-snapshot
Hedetniemi's conjecture for Kneser hypergraphs
inferred← citeshttps://doi.org/10.1016/j.laa.2021.10.023openalex-snapshot
Incidence hypergraphs: Injectivity, uniformity, and matrix-tree theorems
inferred← citeshttps://doi.org/10.1016/j.topol.2019.106877openalex-snapshot
Homology of path complexes and hypergraphs
inferred← citeshttps://doi.org/10.1109/hipc53243.2021.00045openalex-snapshot
Parallel Algorithms for Efficient Computation of High-Order Line Graphs of Hypergraphs
inferred← citeshttps://doi.org/10.1109/lics.1995.523278openalex-snapshot
The Stone gamut: a coordinatization of mathematics
inferred← citeshttps://doi.org/10.1140/epjds/s13688-020-00231-0openalex-snapshot
Hypernetwork science via high-order hypergraph walks
inferred← citeshttps://doi.org/10.1145/3442381.3450073openalex-snapshot
STruD: Truss Decomposition of Simplicial Complexes
inferred← citeshttps://doi.org/10.1145/3485447.3512191openalex-snapshot
FreSCo: Mining Frequent Patterns in Simplicial Complexes
inferred← citeshttps://doi.org/10.13140/rg.2.2.33422.66884openalex-snapshot
A Functorial Link between Quivers and Hypergraphs
inferred← citeshttps://doi.org/10.21236/ada241458openalex-snapshot
Interval Graphs and Hypergraph Acyclicity Degree
inferred← citeshttps://doi.org/10.2206/kyushujm.66.493openalex-snapshot
SIMPLE ^|^Sigma;r-HOMOTOPY TYPES OF HOM COMPLEXES AND BOX COMPLEXES ASSIGNED TO r-GRAPHS
inferred← citeshttps://doi.org/10.26493/1855-3974.1414.58bopenalex-snapshot
Coloring properties of categorical product of general Kneser hypergraphs
inferred← citeshttps://doi.org/10.29007/vkfnopenalex-snapshot
Confluence for Proof-Nets via Parallel Cut Elimination
inferred← citeshttps://doi.org/10.3934/fods.2023010openalex-snapshot
Persistent hyperdigraph homology and persistent hyperdigraph Laplacians
inferred← citeshttps://doi.org/10.4204/eptcs.397.8openalex-snapshot
A Categorical Model for Classical and Quantum Block Designs
inferred← citeshttps://doi.org/10.4310/hha.2022.v24.n2.a18openalex-snapshot
Path homology of directed hypergraphs
inferred← citeshttps://doi.org/10.48550/arxiv.0909.4314openalex-snapshot
Higher-dimensional models of networks
inferred← citeshttps://doi.org/10.48550/arxiv.1004.0583openalex-snapshot
Simple $S_r$-homotopy types of Hom complexes and box complexes associated to $r$-graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1410.3021openalex-snapshot
Hedetniemi's conjecture for Kneser hypergraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1703.04382openalex-snapshot
Cost-Based Intuitionist Probabilities on Spaces of Graphs, Hypergraphs and Theorems
inferred← citeshttps://doi.org/10.48550/arxiv.2002.05014openalex-snapshot
Hypergraphs: an introduction and review
inferred← citeshttps://doi.org/10.48550/arxiv.2007.01842openalex-snapshot
Incidence Hypergraphs: Box Products & the Laplacian
inferred← citeshttps://doi.org/10.48550/arxiv.2010.11448openalex-snapshot
Parallel Algorithms and Heuristics for Efficient Computation of High-Order Line Graphs of Hypergraphs
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.