Displaying 241 – 260 of 374

Showing per page

Point-distinguishing chromatic index of the union of paths

Xiang'en Chen (2014)

Czechoslovak Mathematical Journal

Let G be a simple graph. For a general edge coloring of a graph G (i.e., not necessarily a proper edge coloring) and a vertex v of G , denote by S ( v ) the set (not a multiset) of colors used to color the edges incident to v . For a general edge coloring f of a graph G , if S ( u ) S ( v ) for any two different vertices u and v of G , then we say that f is a point-distinguishing general edge coloring of G . The minimum number of colors required for a point-distinguishing general edge coloring of G , denoted by χ 0 ( G ) , is called...

Point-set domatic numbers of graphs

Bohdan Zelinka (1999)

Mathematica Bohemica

A subset D of the vertex set V ( G ) of a graph G is called point-set dominating, if for each subset S V ( G ) - D there exists a vertex v D such that the subgraph of G induced by S { v } is connected. The maximum number of classes of a partition of V ( G ) , all of whose classes are point-set dominating sets, is the point-set domatic number d p ( G ) of G . Its basic properties are studied in the paper.

Poisson convergence of numbers of vertices of a given degree in random graphs

Wojciech Kordecki (1996)

Discussiones Mathematicae Graph Theory

The asymptotic distributions of the number of vertices of a given degree in random graphs, where the probabilities of edges may not be the same, are given. Using the method of Poisson convergence, distributions in a general and particular cases (complete, almost regular and bipartite graphs) are obtained.

Poisson matching

Alexander E. Holroyd, Robin Pemantle, Yuval Peres, Oded Schramm (2009)

Annales de l'I.H.P. Probabilités et statistiques

Suppose that red and blue points occur as independent homogeneous Poisson processes in ℝd. We investigate translation-invariant schemes for perfectly matching the red points to the blue points. For any such scheme in dimensions d=1, 2, the matching distance X from a typical point to its partner must have infinite d/2th moment, while in dimensions d≥3 there exist schemes where X has finite exponential moments. The Gale–Shapley stable marriage is one natural matching scheme, obtained by iteratively...

Polyèdres finis de dimension 2 à courbure 0 et de rang 2

Sylvain Barré (1995)

Annales de l'institut Fourier

On définit localement la notion de polyèdre de rang deux pour un polyèdre fini de dimension deux à courbure négative ou nulle. On montre que le revêtement universel d’un tel espace est soit le produit de deux arbres, soit un immeuble de Tits euclidien de rang deux.

Polynomial analogues of Ramanujan congruences for Han's hooklength formula

William J. Keith (2013)

Acta Arithmetica

This article considers the eta power ( 1 - q k ) b - 1 . It is proved that the coefficients of q n / n ! in this expression, as polynomials in b, exhibit equidistribution of the coefficients in the nonzero residue classes mod 5 when n = 5j+4. Other symmetries, as well as symmetries for other primes and prime powers, are proved, and some open questions are raised.

Currently displaying 241 – 260 of 374