MOC

2010

13 years 2 months ago
2010

We discuss the numbers in the title, and in particular whether the minimum period of the Bell numbers modulo a prime p can be a proper divisor of Np = (pp - 1)/(p - 1). It is known...

DAM

2010

13 years 5 months ago
2010

An assignment of positive integer weights to the edges of a simple graph G is called irregular if the weighted degrees of the vertices are all different. The irregularity strength,...

CPC

2010

13 years 5 months ago
2010

Let P be a monotone increasing graph property, let G = (V, E) be a graph, and let q be a positive integer. In this paper, we study the (1 : q) Maker-Breaker game, played on the ed...

FSTTCS

2010

Springer

13 years 6 months ago
2010

Springer

In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...

IPL

1998

13 years 7 months ago
1998

An equitable coloring of a graph is a proper vertex coloring such that the sizes of any two color classes diﬀer by at most one. The least positive integer k for which there exis...

COMBINATORICS

1999

13 years 7 months ago
1999

We study the 2-adic behavior of the number of domino tilings of a 2n

ENDM

2002

13 years 8 months ago
2002

Given a positive integer n and a family F of graphs, let R(n, F) denote the maximum number of colors in an edge-coloring of Kn such that no subgraph of Kn belonging to F has disti...

ENDM

2002

13 years 8 months ago
2002

A graph G homogeneously embeds in a graph H if for every vertex x of G and every vertex y of H there is an induced copy of G in H with x at y. The graph G uniformly embeds in H if...

DM

2002

13 years 8 months ago
2002

We propose two new classes of non-adaptive pooling designs. The first one is guaranteed to be

DAM

2002

13 years 8 months ago
2002

For a positive integer k, a k-subdominating function of a graph G = (V; E) is a function f : V {-1; 1} such that uNG[v] f(u)