Non-canonical extensions of Erdős-Ginzburg-Ziv theorem.
Noncommutative determinants, Cauchy-Binet formulae, and Capelli-type identities. I: Generalizations of the Capelli and Turnbull identities.
Noncommutative Sylvester's determinantal identity.
Noncommutative symmetric functions. III: Deformations of Cauchy and convolution algebras.
Non-complete extended -sum of graphs, graph angles and star partitions.
Non-constant continuous mappings of metric or compact Hausdorff spaces
Noncovering of multiples.
Noncrossing partitions, clusters and the Coxeter plane.
Noncrossing trees and noncrossing graphs.
Non-degenerate Hilbert cubes in random sets
A slight modification of the proof of Szemerédi’s cube lemma gives that if a set satisfies , then must contain a non-degenerate Hilbert cube of dimension . In this paper we prove that in a random set determined by for , the maximal dimension of non-degenerate Hilbert cubes is a.e. nearly and determine the threshold function for a non-degenerate -cube.
Nonderogatory directed windmills.
Nonderogatory unicyclic digraphs.
Nonempty intersection of longest paths in a graph with a small matching number
A maximum matching of a graph is a matching of with the largest number of edges. The matching number of a graph , denoted by , is the number of edges in a maximum matching of . In 1966, Gallai conjectured that all the longest paths of a connected graph have a common vertex. Although this conjecture has been disproved, finding some nice classes of graphs that support this conjecture is still very meaningful and interesting. In this short note, we prove that Gallai’s conjecture is true for...
Nonexistence of almost Moore digraphs of diameter three.
Nonexistence of graphs with cyclic defect.
Non-Existence of Steiner Systems of Type S (d - 1, d, 2d).
Nonexistence of triples of nonisomorphic connected graphs with isomorphic connected -graphs.
Nonexistence of twentieth power residue difference sets
Nonexistence results for Hadamard-like matrices.
Non-Hamiltonian Square-minus-two.