The Number of Structures of Finite Relations
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3410949 (Why is no real title available?)
- scientific article; zbMATH DE number 3035682 (Why is no real title available?)
- scientific article; zbMATH DE number 3060434 (Why is no real title available?)
- An Extension of Klein's Erlanger Program: Logic as Invariant-Theory
- On the calculus of relations
- Postulates for the calculus of binary relations
Cited in
(20)- Self-similarity in the combinatorial theory of orthogonal polynomials
- Multisets of Aperiodic Cycles
- Combinatorial properties of binary semigroups
- The functorial composition of species, a forgotten operation
- An enumeration of distinct and non-isomorphic functional quasi-order relations
- Unique nontransitive additive conjoint measurement on finite sets
- On the construction of permutations of a given type kept fixed by conjugation
- A note on the number of functional digraphs
- Kombinatorische Anzahlbestimmungen in Relationen
- Quasi-Orderings and Topologies on Finite Sets
- Enumeration of transitive, step-type relations
- Is hyper-extensionality preservable under deletions of graph elements?
- The Number of Linear, Directed, Rooted, and Connected Graphs
- The number of functional digraphs
- On Combinatorial Structures Kept Fixed by the Action of a Given Permutation
- The Number of Locally Restricted Directed Graphs
- Minimal representatives of endofunctions
- On the nonsingular submatrices of the incidence matrix of a graph over the real field
- Tournaments and even graphs are equinumerous
- The set-theoretic Yang-Baxter equation, Kimura semigroups and functional graphs
This page was built for publication: The Number of Structures of Finite Relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5820553)
