Properties of almost all graphs and complexes
From MaRDI portal
Publication:3208703
DOI10.1002/jgt.3190030305zbMath0418.05050OpenAlexW1970557422MaRDI 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
Related Items (29)
Schedule-induced posets ⋮ Listing graphs that satisfy first-order sentences ⋮ Total monochromatic connection of graphs ⋮ On interval transmission irregular graphs ⋮ First-order queries on databases embedded in an infinite structure ⋮ A Theorem on Reconstruction of Random Graphs ⋮ Binary Covering Arrays and Existentially Closed Graphs ⋮ A note on graphs with a prescribed adjacency property ⋮ On transmission irregular starlike trees ⋮ Spectral determinations and eccentricity matrix of graphs ⋮ Conflict-free connection number of random graphs ⋮ Proper connection number of random graphs ⋮ Expressibility of properties of relations ⋮ Properties of Classes of Random Graphs ⋮ Graph theoretic models ⋮ The almost sure theory of finite metric spaces ⋮ On the line graph of a graph with diameter 2 ⋮ Upper and lower bounds for first order expressibility ⋮ The Rado simplicial complex ⋮ Infinitary logics and 0-1 laws ⋮ Graphs with then-e.c. adjacency property constructed from resolvable designs ⋮ 0-1 laws for maps ⋮ Strong extension axioms and Shelah's zero-one law for choiceless polynomial time ⋮ Graph energy based on the eccentricity matrix ⋮ Rainbow and monochromatic vertex-connection of random graphs ⋮ Almost all comparability graphs are UPO ⋮ Computer based proofs by induction in graph theory - A house of cards? ⋮ Generalized equivalence: A pattern of mathematical expression ⋮ Ample simplicial complexes
Cites Work
This page was built for publication: Properties of almost all graphs and complexes
