Entity usage

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 #201 to #250.

On enumerative equivalence of group elements: Label: en
The toroidal crossing number of the complete graph: Label: en
An inequality for the chromatic number of a graph: Label: en
On the non-existence of graphs with transitive generalized dicyclic groups: Label: en
A geometric approach to a class of cyclic codes: Label: en
On the uniqueness of the Golay codes: Label: en
Some maximal arcs in finite projective planes: Label: en
A lattice characterization of convexity: Label: en
A theorem on n-connected graphs: Label: en
Ballots and trees: Label: en
A lower bound for the order of a partial transversal in a latin square: Label: en
Uniqueness theorems in balanced incomplete block designs: Label: en
A new symmetry of partitions: Label: en
An inequality for B2-sequences: Label: en
Note on a theorem of Zaremba: Label: en
Some results on the maximum length of circuits of spread k in the d-cube: Label: en
Erratum: Label: en
On a conjecture of hasse concerning multiplicative relations of Gaussian sums: Label: en
The square root of a digraph: Label: en
On coloring graphs to maximize the proportion of multicolored k-edges: Label: en
On a conjecture of milner on k-graphs with non-disjoint edges: Label: en
A partial characterization of clique graphs: Label: en
Block designs and graph theory: Label: en
Sums of sets in the elementary abelian group of type (p, p): Label: en
Some squared squares and rectangles: Label: en
Addendum to “on canonical bases of ideals”: Label: en
On Jacobi sums and difference sets: Label: en
A higher invariant for matroids: Label: en
On a theorem of Nordhaus and Gaddum: Label: en
An orthogonality theorem of dines related to moment problems and linear programming: Label: en
An infinite class of 4-designs: Label: en
Euler and bipartite matroids: Label: en
An inequality for permanent of (0, 1)-matrices: Label: en
Some remarks on the van der Waerden conjecture: Label: en
Cycle structure of automorphisms of finite cyclic groups: Label: en
A characterization of idempotents in semigroups: Label: en
The number of graded partially ordered sets: Label: en
A ferromagnetic inequality: Label: en
Generating Functions on idempotent semigroups with application to combinatorial analysis: Label: en
On inequivalent balanced incomplete block designs, I: Label: en
A class of hadamard matrices: Label: en
Combinatorial theorems and integral matrices: Label: en
Determination of two vectors from the sum: Label: en
On Minimal graphs of maximum even girth: Label: en
The degrees of permutation polynomials over finite fields: Label: en
Strongly geodetic graphs: Label: en
On packing of squares and cubes: Label: en
On a paper of fox about a method for calculating the ordinary irreducible characters of symmetric groups: Label: en
Characters and complexity of finite semigroups: Label: en
The number of s-dimensional faces in a complex: An analogy between the simplex and the cube: Label: en