P. Erdos, Some remarks on the theory of graphs, Bull. AMS 53 (1947), 292--294.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....sieve formula. Keywords: composite modulus, explicit Ramsey graph constructions, matrices over rings, co diagonal matrices, modular sieve 1 Introduction Constructing large graphs with small homogeneous vertex sets is a longstanding challenge for combinatorists. The seminal paper of Erdos [2] proved the existence of an O(2 ) vertex graph without a t vertex clique or a t vertex independent set, but the best construction to date due to Frankl and Wilson [3] gives a graph with exp ( 1 Gamma ) log t) log log t vertices. We proved matching bounds in [5] with a ....

P. Erdos. Some remarks on the theory of graphs. Bull. A. M. S., 53:292-- 294, 1947.

....v) k # , which contradicts (1) Proof of Proposition 5. Let G = V, E) be a graph of diameter 2 on vertices, with no independent sets and no cliques larger than C # log n, here C is an absolute constant. It is well known and easy to prove that almost all graphs have these properties, see [9, 6]. Let M be the metric defined by G. Define M 1 = M , and M i = M # [M i 1 ] where # = 2. First we prove by induction that for each i M i is # embeddable in an equilateral space then C # log n. For i = 1 consider a subset S M that is # embeddable in an equilateral space. Since # 2, and G ....

P. Erdos. Some remarks on the theory of graphs. Bull. Amer. Math. Soc., 53:292--294, 1947.

.... 2 stated in Theorem 2 uses the JohnsonLindenstrauss dimension reduction lemma for # 2 [9] For # p , p 2, no such dimension reduction is known to hold. Our proof is based on a non trivial modification of the random construction in [4] in the spirit of Erdos upper bound on the Ramsey numbers [8, 3]. In the process we prove tight bounds on the embeddability of the metrics of complete bipartite graphs in # p . Specifically we show that c p (K n,n ) #(n 1 ) p [1, 2] #( pn) 1 ) p 2. The second part of this note addresses the isometric Ramsey problem for p #) It turns out ....

P. Erdos. Some remarks on the theory of graphs. Bull. Amer. Math. Soc., 53:292--294, 1947. 13

....G i graphs are complete graphs, this corresponds to the original definition, later extended to any graph [57] # Webster University Geneva, Switzerland; From Jan 2002, Dept. of Math, McGill University, Montreal, Canada; rosta math.mcgill.ca The probabilistic proof technique, introduced by Erdos [84] to establish a lower bound of r(K n , K n ) has been generalized and applied to combinatorics, to computer sciences and to various other fields. For more on Ramsey theory in general, we refer to the monograph of Graham, Rothschild and Spencer [135] to the more recent survey article of Nesetril ....

....at least one of the colors. This problem has connection to a question of Preiss in analysis, whether any compact set of positive Lebesgue measure in d space admits a contraction onto a ball. 5 Probabilistic Method versus Constructions The first probabilistic proof is attributed to Erdos [84], who used it to find lower bounds for the classical Ramsey numbers. The idea is simple, but it became very famous as it could be applied in many di#erent situations. 10 Let the edges of a complete graph on n vertices be colored randomly red (blue) with probablity 1 2. There is a coloring with ....

P. Erdos, Some remarks on the theory of graphs, Bull. Amer. Math. Soc. 53 (1947), 292--294.

....F which does not contain monochromatic complete sub system on exp (c k (log m log log m) 1=t ) vertices. Grolmusz: Restricted Multiple Intersections Ramsey Hypergraphs 8 Even for k = 2 (i.e. graphs) it is known, that colorings exist with much smaller monochromatic complete sub systems [Erd47], but here we give an explicit coloring. By our knowledge, this is the first explicit construction for k 2 (hypergraphs) Proof: Sketch) It is more convenient to prove the two color version t = 2, the general case is similar. First construct a set system H with Theorem 11 with p 1 = 2 and p 2 ....

Paul Erdos. Some remarks on the theory of graphs. Bull. A. M. S., 53:292-- 294, 1947.

....one gets the same result for labelled trees. This allows us to say things like: almost all large labelled trees have approximately e Gamma1 1 0 =0 = 1=e leaves (the number of leaves being a Poisson random variable with parameter = 1) Elementary approaches were pioneered by Erdos ([Er47]) which inspired the development of random graph theory (beginning with [ErR60] Gi61] etc. for an overview, see [Pal85] JLR00] or, for a short introduction, Ka95] Since then there has been a growing interest in elementary (and not so elementary) probabilistic methods as outlined in ....

P. Erdos, Some remarks on the theory of graphs, Bull. AMS 53 (1947), 292--294.

....the first color on s vertices, or a monochromatic clique of the second color on m vertices. The fact that these numbers are finite for all s; m is a special case of Ramsey s well known theorem (see, e.g. 10] In one of the first applications of the probabilistic method in combinatorics, Erdos [7] proved that R(m; m) Omega Gamma m2 m=2 ) The problem of finding explicit edge colorings yielding a similar estimate is still open, despite a considerable amount of efforts by various researchers, and the best known explicit construction is due to Frankl and Wilson [9] who gave an explicit ....

P. Erdos, Some remarks on the theory of graphs, Bulletin of the Amer. Math. Soc. 53 (1947), 292--294.

....the case g = log(n) so that we can use Theorem 4.1; the general case is explained at the end of the proof. Let n 2 M be a non standard number of the form 2 s . Take Mn of the form as earlier, and (Mn ; f) the expansion provided by Theorem 4.1, assuming the hypothesis of the theorem. By Erdos [6] there is a graph G 2 M , G = n; E) containing no homogeneous set of size 2s = 2 log n. We shall use E also as the name for the predicate for E in Ln . Define in (Mn ; f) graph G 0 = n 4 ; E 0 ) by xE 0 y j def f(x)Ef(y) E 0 is Delta b 1 (R; E) definable, so (Mn ; f) satisfies ....

Erdos, P.: Some remarks on the theory of graphs. Bulletin of the A.M.S., 53 (1947) 292-294.

....Last Theorem. Dilworth s classical theorem [6] is another typical example in the same spirit. The notion and existence of R(n) together with an effective upper bound, were rediscovered and applied to geometry by Erdos and Szekeres [9] The probabilistic proof technique, introduced by Erdos [7] to establish a lower bound on R(n) is often the starting point in the analysis of randomized algorithms. For more on Ramsey theory in general, we refer to the monograph of Graham, Rothschild and Spencer [13] For a pair of (simple, undirected) graphs (G; H) the generalized Ramsey number R(G; ....

P. Erdos, Some remarks on the theory of graphs, Bull. Amer. Math. Soc. 53 (1947) 292--294.

....subgraph ( clique) on k vertices. The fact that these numbers are finite for all g and k is a special case of Ramsey s well known theorem (see, e.g. 7] and it is easy and known that r g (k) g kg : In one of the first applications of the probabilistic method in combinatorics, Erdos [5] proved that r 2 (k) Omega Gamma k2 k=2 ) As shown in [11] this can be used to show that r g (k) 2 Omega Gamma gk) The problem of finding explicit edge colorings yielding a similar estimate is still open, despite a considerable amount of efforts by various researchers, and the best ....

P. Erdos, Some remarks on the theory of graphs, Bulletin of the Amer. Math. Soc. 53 (1947), 292--294.

....sets. For background in this subject, see [1] 23] The intuition is: for a fixed set I, choose a partition Psi : I] 2 2 at random, and then, by some (non random) process, construct a homogeneous set H for Psi. There are many results in the literature, going back to a 1947 paper of Erdos [6], to the effect that with high probability, H must be fairly thin . Erdos used this to establish an exponential lower bound for the Ramsey numbers. To formalize this intuition, we use the following general framework. Let (X; be a probability space. A random partition of a set I, indexed by 5 ....

P. Erdos, Some remarks on the theory of graphs, Bull. Amer. Math. Soc. 53 (1947) 292-294.

No context found.

P. Erdos, Some remarks on the theory of graphs, Bull. Amer. Math. Soc. 53 (1947), 292-294. 10

....method is a means to prove the existence of configurations by showing that an appropriately defined random configuration has a positive probability of having the desired property. The method is approaching its golden anniversary, its beginning generally considered a three page paper by Paul Erdos [6] in 1947. Closely aligned is the study of random graphs, more generally random configurations, in which problems about probabilities concerning random graphs are considered for their own sake. This topic began in 1961 with the monumental study of Paul Erdos and Alfred R enyi [9] On the evolution ....

....on n vertices must contain either a clique of size l or an independent set of size k. Existence of such n is Ramsey s Theorem itself. Asymptotics of the Ramsey function (and its numerous generalizations) have been closely linked with probabilistic methods from the beginning. Theorem (Erdos (1947)[6]: 1 ) R(k; k) n (15) Proof. Take the random graph G G(n; p) with p = 2 . Then is the expected number of cliques and independent sets of size k. When this number is less than one then with positive probability it is zero so that R(k; k) n. 2 Here we concentrate on l = 3 and ....

P. Erdos, Some remarks on the theory of graphs, Bull. Amer. Math. Soc. 53 (1947), 292-294

.... Probabilistic Methods in Combinatorics Joel Spencer In 1947 Paul Erdos[8] began what is now called the probabilistic method. He showed that if 1 then there exists a graph G on n vertices with clique number (G) k and independence number ff(G) k. In terms of the Ramsey function, R(k; k) n. In modern language he considered the random graph G(n; 5) as ....

P. Erdos. Some remarks on the theory of graphs. Bulletin of the Amer. Math. Soc. 53:292-294, 1947

No context found.

P. Erdos, Some remarks on the theory of graphs, Bull. AMS 53 (1947), 292--294.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC