The conjugacy problem for the automorphism group of the random graph (Q627441): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4331784 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The completeness of the isomorphism relation for countable Boolean algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4511096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Borel reductibility theory for classes of countable structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3927300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Borel equivalence relations and classifications of countable models / rank
 
Normal rank
Property / cites work
 
Property / cites work: The permutation group induced on a moiety / rank
 
Normal rank
Property / cites work
 
Property / cites work: The group of the countable universal graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The automorphism group of the random graph: four conjugates good, three conjugates better. / rank
 
Normal rank

Revision as of 19:25, 3 July 2024

scientific article
Language Label Description Also known as
English
The conjugacy problem for the automorphism group of the random graph
scientific article

    Statements

    The conjugacy problem for the automorphism group of the random graph (English)
    0 references
    0 references
    0 references
    0 references
    2 March 2011
    0 references
    Borel equivalence relations
    0 references
    random graph
    0 references
    categorical structure
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references