Entity usage
From MaRDI portal
This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.
Showing below up to 50 results in range #1 to #50.
- On v1×v2(n, s, t) configurations: Label: en
- Optimal assignments in an ordered set: An application of matroid theory: Label: en
- On the reconstruction of a graph from its closure function: Label: en
- Numerical calculations on the four-color problem: Label: en
- On the number of k-simplexes in the m-th barycentric subdivision of an r-simplex: Label: en
- Characteristic polynomials of incidence matrices: Label: en
- A rank inequality for finite geometric lattices: Label: en
- Potential theory on a rhombic lattice: Label: en
- Maximal number of subsets of a finite set No k of which are pairwise disjoint: Label: en
- On the cycle index of a product of permutation groups: Label: en
- Recursive formulas on free distributive lattices: Label: en
- Designs derived from permutation groups: Label: en
- Note on “A characterization of cubic lattice graphs”: Label: en
- Matching algorithms: Label: en
- Some theorems on the free groups of certain product varieties: Label: en
- An elementary proof of p(11m+6)≡0 (mod 11): Label: en
- Excessive functions of continuous time Markov chains: Label: en
- Probability of a pure equilibrium point in n-person games: Label: en
- On free monoids partially ordered by embedding: Label: en
- Coverings by rook domains: Label: en
- Transversals of infinite families with finitely many infinite members: Label: en
- A lower bound for the number of non-isomorphic matroids: Label: en
- Bottleneck extrema: Label: en
- Orthogonal sets of vectors over Zm: Label: en
- Réarrangements de fonctions et dénombrement: Label: en
- Enumeration of non-separable graphs: Label: en
- Remarks on the van der Waerden permanent conjecture: Label: en
- Group transitivity and a multiplicative function of a partition: Label: en
- On the number of orthogonal latin squares: Label: en
- On the factorisation of the complete graph into factors of diameter 2: Label: en
- On a problem concerning separating systems of a finite set: Label: en
- Algebras defined by patterns of zeros: Label: en
- A procedure for dissecting a rectangle into squares, and an example for the rectangle whose sides are in the ratio 2:1: Label: en
- On 2-level orthogonal arrays of odd index: Label: en
- Graphs with circulant adjacency matrices: Label: en
- On chromatic polynomials and the golden ratio: Label: en
- Heterogeneous algebras: Label: en
- A theorem on three-coloring the edges of a trivalent graph: Label: en
- A note on coefficients of chromatic polynomials: Label: en
- Interconnections of related BIBDs: Label: en
- An inversion problem associated with compositions: Label: en
- Power-translation invariance in discrete groups—A characterization of finite Hamiltonian groups: Label: en
- A combinatorial invariant for finite Abelian groups with various applications: Label: en
- On nonreconstructable tournaments: Label: en
- Automorphism groups of Hadamard matrices: Label: en
- An elementary solution to a problem in restricted partitions: Label: en
- Regular d-valent graphs of girth 6 and 2(d2−d+1) vertices: Label: en
- n-Hamiltonian graphs: Label: en
- Correspondences between plane trees and binary sequences: Label: en
- Disproof of a conjecture of Erdös and moser on tournaments: Label: en