Google Answers Logo
View Question
 
Q: Model theory - combinatorics of rigid graphs ( No Answer,   1 Comment )
Question  
Subject: Model theory - combinatorics of rigid graphs
Category: Science > Math
Asked by: mathdude123-ga
List Price: $100.00
Posted: 29 Apr 2005 13:29 PDT
Expires: 30 Apr 2005 15:40 PDT
Question ID: 515929
A function f is an automorphism of A iff f is an isomorphism of A onto
itself. A structure A is rigid iff the only automorphism of A is the
identity function from A onto A.  Let G_n be the set of simple graphs
with node set {1,...,n} and let G = (union of all finite n) G_n.  Let
R contained in G be the set of ridig simple graphs and let R_n = R
(intersect) G_n. The problem is to show that lim (n->infinity) |R_n| /
|G_n| = 1.

Desired time is one week.
Answer  
There is no answer at this time.

Comments  
Subject: Re: Model theory - combinatorics of rigid graphs
From: limeape-ga on 29 Apr 2005 16:42 PDT
 
I believe the answer is yes and should exist in the standard literature.
The question is not completely unambiguous, but I could assist you in
clarifying and finding a satisfactory answer within the time frame
that you indicate.

Unfortunately though, since I am not a google researcher, I am unable
to be paid for this
effort and am unwilling to perform this service voluntarily.

Important Disclaimer: Answers and comments provided on Google Answers are general information, and are not intended to substitute for informed professional medical, psychiatric, psychological, tax, legal, investment, accounting, or other professional advice. Google does not endorse, and expressly disclaims liability for any product, manufacturer, distributor, service or service provider mentioned or any opinion expressed in answers or comments. Please read carefully the Google Answers Terms of Service.

If you feel that you have found inappropriate content, please let us know by emailing us at answers-support@google.com with the question ID listed above. Thank you.
Search Google Answers for
Google Answers  


Google Home - Answers FAQ - Terms of Service - Privacy Policy