Andrew Granville, Carl Pomerance, Paul Erdos
Abstract. Erdos [8] conjectured that there are x
Upper Bounds on Linear-Vertex Arboricity of Complementary Graphs (2007)
Yousef Alavi, Paul Erdos, Don Lick, Jiuqiang Liu
Thelinearvertex-arboricityae 0 (G) ofagraphG isdefinedtobetheminimum number of subsets into which the vertex set of G can be partitioned such that each subset induces a linear forest. In [1], Alavi...
The Difference Between a Graph and Its Square (2007)
Donald Aingworth, Rajeev Motwani, Frank Harary, Dedicated Uncle, Paul Erdos
The square of a graph G of order n nodes and size m edges is denoted G 2 . It is obtained from G by adding new edges joining all pairs of nodes at distance 2 in G. The 2-step graph of G, denoted G...
submitted to Colloquium Math.. (2007)
P. Vertesi, In Memoriam, Paul Erdos, P. Borwein, Pointwise Remez, T. Erdelyi, ...
72. T. Erdelyi, The norm of the polynomial truncation operator on the unit disk and on [-1, 1],
Dedicated to the memory of (2007)
Laszlo Liptak, Laszlo Lovasz, Paul Erdos
A facet of the stable set polytope of a graph G can be viewed as a generalization of the notion of an #-critical graph. We extend several results from the theory of #-critical graphs to facets. The...
Nonbases of Density Zero not Contained in Maximal Nonbases (2006)
Erdos, Paul, Nathanson, Melvyn B.
A sequence A = {ai} of non-negative integers is a basis if every sufficiently large integer n can be written in the form n = ai+aj with ai, aj ∈ A. If A is not a basis, then A is...
Nanog Seattle, Martin Hannigan, Famous Quote, Paul Erdos
• Increased threats and security demands by customers and the Operator community have led to pressure on Operators and Providers to provide a more secure Internet. • This panel will examine...
On the Distribution of the Greatest Common Divisor. (2002)
The limiting joint distribution of the least common multiple and the greatest common divisor is determined. The lead term is given for the moments of both marginal distributions. The results are...
Critical Facets of the Stable Set Polytope (1999)
László Lipták, László Lovász, Paul Erdos
A facet of the stable set polytope of a graph G can be viewed as a generalization of the notion of an ff-critical graph. We extend several results from the theory of ff-critical graphs to facets. The...
The Arithmetic Function The Summation from d/n of logd/d. (1998)
Revision of report dated 14 Dec 72.
Diverse homogeneous sets (1992)
Blass, Andreas, Erdos, Paul, Taylor, Alan
A set H [subset of or equal to] [omega] is said to be diverse with respect to a partition [Pi] of [omega] if at least two pieces of [Pi] have an infinite intersection with H. A family of partitions...
Dot product rearrangements (1983)
Let a=(an), x=(xn) denote nonnegative sequences; x=(xÀ(n)) denotes the rearranged sequence determined by the permutation À, a⋅x denotes the dot product ∑anxn;...
Dot product rearrangements (1983)
Let a=(an), x=(xn) denote nonnegative sequences; x=(xπ(n)) denotes the rearranged sequence determined by the permutation π, a⋅x denotes the dot product ∑anxn; and S(a,x) denotes...