Properties of almost all graphs and complexes
From MaRDI portal
Publication:3208703
DOI10.1002/jgt.3190030305zbMath0418.05050MaRDI QIDQ3208703
Publication date: 1979
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190030305
05C99: Graph theory
Related Items
A Theorem on Reconstruction of Random Graphs, Properties of Classes of Random Graphs, Strong extension axioms and Shelah's zero-one law for choiceless polynomial time, A note on graphs with a prescribed adjacency property, Expressibility of properties of relations, Almost all comparability graphs are UPO, Generalized equivalence: A pattern of mathematical expression, Schedule-induced posets, Graph theoretic models, Upper and lower bounds for first order expressibility, Infinitary logics and 0-1 laws, Computer based proofs by induction in graph theory - A house of cards?, Listing graphs that satisfy first-order sentences, First-order queries on databases embedded in an infinite structure, Unnamed Item
Cites Work