Expected number of faces in a random embedding of any graph is at most linear (Q6085874): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Random 2-cell embeddings of multistars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3757929 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs on surfaces and their applications. Appendix by Don B. Zagier / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2726740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound for the average number of regions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the average genus of the random graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two enumerative results on cycles of permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5684700 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Introduction to Random Topological Graph Theory / rank
 
Normal rank

Revision as of 12:13, 3 August 2024

scientific article; zbMATH DE number 7762895
Language Label Description Also known as
English
Expected number of faces in a random embedding of any graph is at most linear
scientific article; zbMATH DE number 7762895

    Statements

    Expected number of faces in a random embedding of any graph is at most linear (English)
    0 references
    0 references
    0 references
    8 November 2023
    0 references
    random embeddings
    0 references
    average genus
    0 references
    random topological graph theory
    0 references

    Identifiers