Pre-signed graphs. II: The average non-orientable genus of the random graph

DOI10.1016/J.EJC.2026.104413MaRDI QIDQ7302253zbMATH OpenFDO

Authors Yi Chao Chen

Publication date 22 July 2026

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EJC.2026.104413

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Signed and weighted graphs (05C22) Random graphs (graph-theoretic aspects) (05C80)

Cites work

• A simple algorithm to detect balance in signed graphs
• An Euler-genus approach to the calculation of the crosscap-number polynomial
• An Introduction to Random Topological Graph Theory
• Combinatorics of orientation reversing polygons
• Expected number of faces in a random embedding of any graph is at most linear
• Generalized Embedding Schemes
• Glossary of signed and gain graphs and allied areas
• Graph-encoded maps
• Graphs of groups on surfaces. Interactions and models
• Graphs on surfaces. Dualities, polynomials, and knots
• Hierarchy for imbedding-distribution invariants of a graph
• scientific article; zbMATH DE number 4006288 (Why is no real title available?)
• scientific article; zbMATH DE number 53883 (Why is no real title available?)
• scientific article; zbMATH DE number 3641502 (Why is no real title available?)
• Kuratowski-type theorems for average genus
• Limit points for average genus. I: 3-connected and 2-connected simplicial graphs
• Limit points for average genus. II: 2-connected non-simplicial graphs
• Lower bounds for the average genus
• New bounds for the average genus and average number of faces of a simple graph
• On the average genus of the random graph
• On the genus of a random graph
• On the notion of balance of a signed graph
• Orientation embedding of signed graphs
• Overlap matrices and total imbedding distributions
• Permutation-Partition Pairs II: Bounds on the Genus of the Amalgamation of Graphs
• Permutation-Partition Pairs: A Combinatorial Generalization of Graph Embeddings
• Planarity and genus of sparse random bipartite graphs
• Pre-signed graphs: a reformulation of signed graphs and their embeddings
• Random 2-cell embeddings of multistars
• Random graphs.
• Region distributions of graph embeddings and Stirling numbers
• Signed Graphs and Geometry
• The combinatorial map color theorem
• The genus of a random bipartite graph
• The genus of a random graph
• The genus of the Erdős-Rényi random graph and the fragile genus property
• The projective-planar signed graphs

This page was built for publication: Pre-signed graphs. II: The average non-orientable genus of the random graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7302253)