P. Erdos, A. Renyi, Asymmetric graphs, Acta Math. Acad. Sci. Hungar. 14 (1963) 295--315.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....is asymmetric if Aut(G) does not contain any permutation other than the identity, otherwise we call G symmetric. The automorphism group was one of the fundamental objects studied by P. Erdos and A. Renyi in a sequence of papers, which actually started the theory of random graphs. Erdos and Renyi [5] proved that for 1 ln n n ln n n, almost surely G(n, p) is asymmetric. In fact, they proved a little bit more, that almost surely one should alter (delete and add) at least (2 o(1) np(1 edges of G(n, p) to obtain a symmetric graph. The problem is somewhat more complex for the random ....

....F which agrees with f on the bad instances (F (G) 0 if f(G) 0) but takes values in a large interval otherwise (in our case F is the defect) Defining F properly, we have a better chance of showing that F is concentrated above 0, which yields the desired conclusion. Erdos and Renyi [5] proved that every graph G of order n with average degree d contains a pair of vertices u, v such that the number of vertices of G joined precisely to one of u, v is at most 2d n 1 . Let # be a transposition of u and v. Then we obtain that D(G) D # (G) On the other hand, ....

P. Erdos and A. Renyi, Asymmetric graphs, Acta Math. Acad. Sci. Hungar. 14 (1963), 295--315.

....the graphs in (a) c) the Frasse limit of the class of finite graphs not containing K n , for a fixed 3; d) the complements of the graphs in (c) e) the random graph R, which is the Frasse limit of the class of all finite graphs. The random graph R was discovered in 1963 by Erdos and Renyi [39]. It is called random because, with probability 1, it is isomorphic to the graph constructed as follows: take a countable vertex set and, for each pair of vertices, decide independently with probability whether or not they are adjacent. Here is a surprising deterministic construction of the ....

P. Erdos and A. Renyi, Asymmetric graphs, Acta Math. Hungar. 14 (1963), 295--315.

....the graphs in (a) c) the Frasse limit of the class of finite graphs not containing K n , for a fixed 3; d) the complements of the graphs in (c) e) the random graph R, which is the Frasse limit of the class of all finite graphs. The random graph R was discovered in 1963 by Erdos and Renyi [39]. It is called random because, with probability 1, it is isomorphic to the graph constructed as follows: take a countable vertex set and, for each pair of vertices, decide independently with probability whether or not they are adjacent. Here is a surprising deterministic construction of the ....

P. Erdos and A. Renyi, Asymmetric graphs, Acta Math. Hungar. 14 (1963), 295--315.

....asymmetric if Aut(G) does not contain any permutation other than the identity, otherwise we call G symmetric. The automorphism group was one of the fundamental objects studied by P. Erd os and A. R enyi in a sequence of papers, which actually started the theory of random graphs. Erd os and R enyi [5] proved that for 1 ln n=n p ln n=n, almost surely G(n; p) is asymmetric. In fact, they proved a little bit more, that almost surely one should alter (delete and add) at least (2 o(1) np(1 p) edges of G(n; p) to obtain a symmetric graph. The problem is somewhat more complex for the random ....

....F which agrees with f on the bad instances (F (G) 0 if f(G) 0) but takes values in a large interval otherwise (in our case F is the defect) De ning F properly, we have a better chance of showing that F is concentrated above 0, which yields the desired conclusion. Erd os and R enyi [5] proved that every graph G of order n with average degree d contains a pair of vertices u; v such that the number of vertices of G joined precisely to one of u; v is at most 2d 1 d n 1 . Let be a transposition of u and v. Then we obtain that D(G) D (G) 2d 1 d n 1 : On the ....

P. Erd}os and A. Renyi, Asymmetric graphs, Acta Math. Acad. Sci. Hungar. 14 (1963), 295-315.

....graphs, including strongly regular graphs (discussed in Chapter ) 3 Automorphisms of typical graphs The smallest graph (apart from the one vertex graph) whose automorphism group is trivial is shown in Figure 2. However, small graphs are (as usual) not a reliable guide here. Erd os and R enyi [16] showed: Theorem 3.1 Almost all graphs have no non trivial automorphisms. That is, the proportion of graphs on n vertices which have a non trivial automorphism tends to zero as n 1. This is true whether we take labelled or unlabelled graphs. As noted in the introduction, the theorem implies ....

....methods of quantifying the theorem can be found. For example, given any graph, we can alter it so that some two vertices have the same neighbour sets by altering at most n=2 adjacencies. The resulting graph has an automorphism interchanging the two vertices and xing all others. Erd os and R enyi [16] showed that, for almost all graphs, this is the shortest distance to symmetry . 5 4 Permutation groups The question, Which permutation groups are the full automorphism groups of graphs , has no easy answer. Given a permutation group G on a set we can describe all the graphs on which G acts ....

[Article contains additional citation context not shown here]

P. Erd}os and A. Renyi, Asymmetric graphs, Acta Math. Acad. Sci. Hungar. 14 (1963), 295-315.

....called the Rado graph. It is also sometimes called the random countable graph, since with probability 1, this graph is generated by a random process where we start with a countable set of nodes, and where each possible edge appears with probability 1 2 , independently of the other edges [ER63, Gai64] (see also [ES74, pp. 98 99] A useful feature of the random countable graph (that will be exploited later) is that every countable graph is embeddable in it. Thus, let us say that a graph H with universe H is a subgraph of the graph G if the edges of H are precisely those edges of G where both ....

P. Erdos and A. R'enyi. Asymmetric graphs. Acta Math. Acad. Sci. Hung. Acad. Sci., 14:295--315, 1963.

....n or a regular complete multipartite graph K t;n or the 3 3 lattice graph L 3;3 on 9 vertices or the graph C 5 of the pentagon. Lachlan and Woodrow [12] have determined in 1980 all countable ultrahomogeneous graphs (one of them being the famous random graph discovered in 1963 by Erd os and R enyi [14]) Devillers and Doyen [7] proved in 1998 that any ultrahomogeneous linear space is either reduced to a single point or a single line, or has only lines of size 2, or is one of the Desarguesian projective planes PG(2; 2) or PG(2; 3) 2 The purpose of this paper is to extend the preceding ....

P.Erdos and A.Renyi, Asymmetric graphs, Acta Math. Hungar. 14 (1963), 295-315.

....is an edge or a non edge, independently of all other choices. If the vertex set is nite, then every possible graph occurs, with probability inversely proportional to the order of its automorhism group; indeed, graphs with no symmetry at all predominate. On the other hand, Erd os and R enyi [9] showed the following: Theorem 1.2. There is a countable graph R such that, with probability 1, the random graph on a countable vertex set is isomorphic to R. Of course, R is the graph we met above, the Fra ss e limit of the class of all nite graphs. The proof is simple: we have to show that ....

P. Erd}os and A. Renyi, Asymmetric graphs, Acta Math. Acad. Sci. Hungar. 14 (1963), 295-315.

....graph can be reduced to a graph having a non trivial automorphism. Moreover, the bound of 5 edges cannot be lowered to 4. 1 Introduction A graph G is called asymmetric if it admits no non trivial automorphism. Asymmetry is the typical behaviour of finite graphs. In 1963, Erdos and R enyi [2] proved that almost all graphs are asymmetric. They further proved in [2] that if s(n) is the maximum number of edges which must be added to and or deleted from, a graph with n vertices in order The work of this author was supported by grant 97 01 01075 from the Russian Foundation of Fundamental ....

....Moreover, the bound of 5 edges cannot be lowered to 4. 1 Introduction A graph G is called asymmetric if it admits no non trivial automorphism. Asymmetry is the typical behaviour of finite graphs. In 1963, Erdos and R enyi [2] proved that almost all graphs are asymmetric. They further proved in [2] that if s(n) is the maximum number of edges which must be added to and or deleted from, a graph with n vertices in order The work of this author was supported by grant 97 01 01075 from the Russian Foundation of Fundamental Research. y The work of this author was supported by the program ....

P. Erdos and A. R'enyi, Asymmetric graphs, Acta Math. Acad. Sci. Hungar. 14 (1963),295-315.

....M 24 among others: see [24] 8 Automorphism groups This section gives some problems on automorphism groups. It is known that every finite group is the full automorphism group of a finite graph (Frucht [45] and that almost all finite graphs have trivial automorphism group (Erdos and R enyi [40]) In [15] I gave a result including both of these facts: Theorem 8.1 For any finite group G, there is a rational number ff(G) such that, if X is a random G invariant graph, the probability that Aut(X) G tends to ff(G) as n 1. Moreover, ff(G) 1 if and only if G is a direct product of ....

....theorem are determined. For a dual result, see [86] 10 Generic tuples of orders In this section I consider briefly the problem of extending analysis of random permutations to permutations of infinite sets. We must expect things to be very different. In a similar context, Erdos and R enyi [40] showed that there is a unique countable random graph , whose structural properties are wholly unlike those of finite random graphs. According to Erdos and Spencer [41] this demolishes the theory of countable random graphs; but it creates instead the theory of the countable random graph (see ....

P. Erdos and A. R'enyi, Asymmetric graphs, Acta Math. Acad. Sci. Hungar. 14 (1963), 295--315.

....random graph, digraph or tournament almost always coincides with G, provided that G acts semiregularly with a large number of orbits. These statements, specialized to jGj = 1, prove the well known facts that almost all labelled graphs, digraphs, tournaments are asymmetric (automorphism free) [14]) On the other hand, they also prove the existence of graphs, digraphs, tournaments with prescribed abstract groups G as their full automorphism groups (with jGj odd in the case of tournaments) The existence of such objects can, however, be proved quite easily by direct constructions (cf. e.g. ....

P. Erdos and A. R'enyi, Asymmetric graphs, Acta Math. Acad. Sci. Hungar. 14 (1963), 295--315.

....way: impose two copies of the structure S on the underlying set, and consider all those permutations which are automorphisms of both structures simultaneously. Thus, Proposition 2. 3 should be compared with the statement almost all graphs have trivial automorphism group (Erdos and R enyi [6]) As the analogue of Frucht s theorem [8] we propose the following conjecture: Conjecture 2.4. Let G 1 ; G 2 ; be primitive groups of degrees n 1 ; n 2 ; where n i 1 and G i 6= Sn i or An i for all i. Let X be an abstract group which is embeddable in G i for infinitely many ....

P. Erdos and A. R'enyi, Asymmetric graphs, Acta Math. Acad. Sci. Hungar. 14 (1963), 295--315.

....and partly as a simple introduction to the technique. The random graph, or Rado s graph (which will be here denoted by R) is the Fraiss e limit of the class of all finite graphs (which is clearly a Fraiss e class) It was constructed explicitly by Rado [13] and implicitly by Erdos and R enyi [8], who showed that a countable random graph (with edges chosen independently with probability 1 2 ) is almost surely isomorphic to R. The Baire category analogue of this fact is that the isomorphism class of R is residual in the class of all graphs (on a given countable vertex set) Now let X be ....

P. Erdos and A. R'enyi, Asymmetric graphs, Acta Math. Acad. Sci. Hungar. 14 (1963), 295--315.

....(up to isomorphism) The asymptotics of this sequence appear to be unknown. Exponential of a polynomial. The most famous example arises as follows. The class of all finite graphs is a Fraiss e class. Its Fraiss e limit is the celebrated countable random graph R discovered by Erdos and R enyi [6]. Thus, f n (Aut(R) is the number of n vertex graphs up to isomorphism, which is asymptotically 2 n(n Gamma1) 2 =n (since almost all finite graphs have trivial automorphism group) It is worth observing here that there is no upper bound to the growth rates which can be achieved: it is ....

P. Erdos and A. R'enyi, Asymmetric graphs, Acta Math. Acad. Sci. Hungar. 14 (1963), 295--315.

....with the preceding is as follows. A structure M is said to be homogeneous if any isomorphism between finite substructures of M extends to an automorphism of M . Examples of homogeneous structures include the pentagon, the rational numbers Q (as ordered set) and the random graph or Rado s graph [5], 14] A theorem of Fraiss e [7] characterizes the ages of countable homogeneous structures. In particular, a class A of structures satisfying our conditions (that is, closed under isomorphism and under induced substructures and containing only finitely many n element structures up to ....

P. Erdos and A. R'enyi, Asymmetric graphs, Acta Math. Acad. Sci. Hungar. 14 (1963), 295--315.

No context found.

P. Erdos, A. Renyi, Asymmetric graphs, Acta Math. Acad. Sci. Hungar. 14 (1963) 295--315.

No context found.

P. Erdos and A. Renyi. Asymmetric graphs. Acta Math. Acad. Sci. Hung. Acad. Sci., 14:295--315, 1963.

No context found.

P. Erdos, A. Renyi, Asymmetric graphs, Acta Math. Acad. Sci. Hungar. 14 (1963) 295-315.

No context found.

P. Erdos, A. Renyi, Asymmetric graphs, Acta Math. Acad. Sci. Hungar. 14 (1963) 295--315.

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