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