On the public citation graph

Aspects of the theory of hypermatroids

0 signed · 50 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/978-0-8176-4842-8_29openalex-snapshot

Möbius Inversion in Lattices

inferredcites →https://doi.org/10.1007/978-1-4684-9936-0_3openalex-snapshot

Categories and Functors

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

On the foundations of combinatorial theory I. Theory of M�bius Functions

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

The Tutte polynomial

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

Möbius inversion in lattices

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

The Many Facets of Graph Theory

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

Matroids versus graphs

inferredcites →https://doi.org/10.1215/s0012-7094-44-01150-6openalex-snapshot

Dependence relations in a semi-modular lattice

inferredcites →https://doi.org/10.5282/ubm/epub.7244openalex-snapshot

Categories and Functors

What points at this work

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

inferred← citeshttps://doi.org/10.1006/aama.1998.0583openalex-snapshot

Matroids on Partially Ordered Sets

inferred← citeshttps://doi.org/10.1006/aama.1999.0660openalex-snapshot

Arrangements, Channel Assignments, and Associated Polynomials

inferred← citeshttps://doi.org/10.1006/jctb.1997.1789openalex-snapshot

A 2-Isomorphism Theorem for Hypergraphs

inferred← citeshttps://doi.org/10.1007/3-540-45687-2_11openalex-snapshot

Matroid Intersections, Polymatroid Inequalities, and Related Problems

inferred← citeshttps://doi.org/10.1007/978-3-031-86319-6_18openalex-snapshot

Graph Polynomials: Some Questions on the Edge

inferred← citeshttps://doi.org/10.1007/978-3-319-13129-0_14openalex-snapshot

Resource Competition on Integral Polymatroids

inferred← citeshttps://doi.org/10.1007/978-3-540-30551-4_21openalex-snapshot

Bounding the Payment of Approximate Truthful Mechanisms

inferred← citeshttps://doi.org/10.1007/978-3-642-68874-4_10openalex-snapshot

Submodular functions and convexity

inferred← citeshttps://doi.org/10.1007/bf01303518openalex-snapshot

Some excluded-minor theorems for a class of polymatroids

inferred← citeshttps://doi.org/10.1007/bf01840474openalex-snapshot

A geometric theory of hypergraph colouring

inferred← citeshttps://doi.org/10.1007/s00026-020-00506-3openalex-snapshot

Cyclic Flats of a Polymatroid

inferred← citeshttps://doi.org/10.1007/s10107-021-01642-1openalex-snapshot

Matroid bases with cardinality constraints on the intersection

inferred← citeshttps://doi.org/10.1016/j.aim.2022.108355openalex-snapshot

Universal Tutte polynomial

inferred← citeshttps://doi.org/10.1016/j.dam.2019.06.014openalex-snapshot

Polymatroid-based capacitated packing of branchings

inferred← citeshttps://doi.org/10.1016/j.ejc.2017.04.006openalex-snapshot

Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs

inferred← citeshttps://doi.org/10.1016/j.ejc.2020.103179openalex-snapshot

Decomposable polymatroids and connections with graph coloring

inferred← citeshttps://doi.org/10.1016/j.orl.2024.107217openalex-snapshot

Analysis of the two-for-one swap heuristic for approximating the maximum independent set in a k-polymatroid

inferred← citeshttps://doi.org/10.1016/j.orl.2025.107381openalex-snapshot

A simplified analysis of the ascending auction to sell a matroid base

inferred← citeshttps://doi.org/10.1016/j.tcs.2014.10.019openalex-snapshot

Bounding the payment of approximate truthful mechanisms

inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00455-9openalex-snapshot

An inequality for polymatroid functions and its applications

inferred← citeshttps://doi.org/10.1016/s0304-0208(08)73649-1openalex-snapshot

References

inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00831-9openalex-snapshot

The Go polynomials of a graph

inferred← citeshttps://doi.org/10.1080/1055678021000060801openalex-snapshot

Generating dual-bounded hypergraphs

inferred← citeshttps://doi.org/10.1109/allerton.2015.7447046openalex-snapshot

On the representability of integer polymatroids: Applications in linear code construction

inferred← citeshttps://doi.org/10.1109/tit.2006.887090openalex-snapshot

Two Constructions on Limits of Entropy Functions

inferred← citeshttps://doi.org/10.1109/tit.2026.3666525openalex-snapshot

Weakly Private Distributed Multi-User Secret Sharing

inferred← citeshttps://doi.org/10.1137/22m1521122openalex-snapshot

The Natural Matroid of an Integer Polymatroid

inferred← citeshttps://doi.org/10.1137/22m1521134openalex-snapshot

The Excluded Minors for Three Classes of 2-Polymatroids Having Special Types of Natural Matroids

inferred← citeshttps://doi.org/10.1137/s0895480103428338openalex-snapshot

On the Complexity of Some Enumeration Problems for Matroids

inferred← citeshttps://doi.org/10.1142/9789812569462_0011openalex-snapshot

Polynomials Related to Chromatic Polynomials

inferred← citeshttps://doi.org/10.1145/3727625openalex-snapshot

An Ascending Polynomial Running Time Vickrey Auction for Selling Bases of an Integer Polymatroid

inferred← citeshttps://doi.org/10.1287/moor.2022.1322openalex-snapshot

Sampling from the Gibbs Distribution in Congestion Games

inferred← citeshttps://doi.org/10.1287/opre.1100.0888openalex-snapshot

An Ascending Vickrey Auction for Selling Bases of a Matroid

inferred← citeshttps://doi.org/10.1515/jmc-2019-0045openalex-snapshot

Secret sharing and duality

inferred← citeshttps://doi.org/10.21136/mb.1994.126084openalex-snapshot

About a generalization of transversals

inferred← citeshttps://doi.org/10.37236/3679openalex-snapshot

Certificates for Properties of Stability Polynomials of Graphs

inferred← citeshttps://doi.org/10.48550/arxiv.1210.7931openalex-snapshot

Polymatroids and polyquantoids

inferred← citeshttps://doi.org/10.48550/arxiv.1909.02353openalex-snapshot

Sticky matroids and convolution

inferred← citeshttps://doi.org/10.5802/alco.447openalex-snapshot

Combinatorial flats and Schubert varieties of subspace arrangements

inferred← citeshttps://doi.org/10.70675/4d7fad71zfb01z4879za839zdd1077119fe6openalex-snapshot

Tropical linear series, combinatorial flag arrangements and applications to the study of Weierstrass points

inferred← citeshttps://doi.org/10.7151/dmgt.1128openalex-snapshot

Chromatic polynomials 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.