On existentially complete triangle-free graphs
From MaRDI portal
Publication:2182038
DOI10.1007/s11856-020-1982-3zbMath1487.05180arXiv1708.08817OpenAlexW3011631750MaRDI QIDQ2182038
Julian Sahasrabudhe, Shoham Letzter
Publication date: 20 May 2020
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1708.08817
Random graphs (graph-theoretic aspects) (05C80) Structural characterization of families of graphs (05C75) Generalized Ramsey theory (05C55) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Graphs whose every independent set has a common neighbour
- Partitions and orientations of the Rado graph
- Maximum degree in graphs of diameter 2
- Triply Existentially Complete Triangle‐Free Graphs
- Universal graphs and universal functions
- The random graph
- A family of countable homogeneous graphs
- The strange logic of random graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On existentially complete triangle-free graphs