On zero-one and convergence laws for graphs embeddable on a fixed surface
From MaRDI portal
Recommendations
- Logical properties of random graphs from small addable classes
- Logical limit laws for minor-closed classes of graphs
- EMSO(FO^2) 0-1 Law Fails for All Dense Random Graphs
- Logical laws for short existential monadic second-order sentences about graphs
- Existential monadic second order logic of undirected graphs: the Le Bars conjecture is false
Cites work
- Almost all maps are asymmetric
- Asymptotic enumeration and limit laws for graphs of fixed genus
- Graph classes with given 3-connected components: asymptotic enumeration and random graphs
- Graph structure and monadic second-order logic. A language-theoretic approach
- Graphs on surfaces
- scientific article; zbMATH DE number 16301 (Why is no real title available?)
- scientific article; zbMATH DE number 1156578 (Why is no real title available?)
- scientific article; zbMATH DE number 892539 (Why is no real title available?)
- Logical limit laws for minor-closed classes of graphs
- Spanning trees in 3-connected \(K_{3,t}\)-minor-free graphs
- The monadic second-order logic of graphs. XI: Hierarchical decompositions of connected graphs
- The monadic second-order logic of graphs. XII: Planar graphs and planar maps
Cited in
(3)
This page was built for publication: On zero-one and convergence laws for graphs embeddable on a fixed surface
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5002801)
