Properties of almost all graphs and complexes

DOI10.1002/JGT.3190030305MaRDI QIDQ3208703zbMATH OpenOpenAlexFDO

Authors Andreas Blass, Frank Harary

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

zbMATH Keywords

general logical theoremproperties of graphs

Mathematics Subject Classification ID

Graph theory (05C99)

Cites work

• Almost all Tournaments are Irreducible

Cited in

(34)

• 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
• Rainbow and monochromatic vertex-connection of random graphs
• Ample simplicial complexes
• On interval transmission irregular graphs
• On transmission irregular starlike trees
• Conflict-free connection number of random graphs
• On the line graph of a graph with diameter 2
• The Rado simplicial complex
• Graph energy based on the eccentricity matrix
• Total monochromatic connection of graphs
• Spectral determinations and eccentricity matrix of graphs
• Graphs with the \(n\)-e.c. adjacency property constructed from resolvable designs
• 0-1 laws for maps
• 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
• Binary Covering Arrays and Existentially Closed Graphs
• The almost sure theory of finite metric spaces
• Characterization of transmission irregular starlike and double starlike trees
• Large simplicial complexes: universality, randomness, and ampleness
• On transmission-irregular graphs and long pendent paths
• Constructing adjacency and distance cospectral graphs via regular rational orthogonal matrix
• First-order logic with equicardinality in random graphs
• Almost all comparability graphs are UPO
• Proper connection number of random graphs

This page was built for publication: Properties of almost all graphs and complexes

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