Triply Existentially Complete Triangle‐Free Graphs

DOI10.1002/jgt.21808zbMath1309.05125arXiv1306.5637OpenAlexW3124336411MaRDI QIDQ4982291

Chaim Even-Zohar, Nathan Linial

Publication date: 24 March 2015

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1306.5637

zbMATH Keywords

combinatorial problemsstable homogeneous structuresfinite homogeneity

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Model theory of finite structures (03C13) Directed graphs (digraphs), tournaments (05C20) Quantifier elimination, model completeness, and related topics (03C10)

Related Items (2)

On existentially complete triangle-free graphs ⋮ Henson graphs and Urysohn-Henson graphs as Cayley graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 2-colorings of complete graphs with a small number of monochromatic \(K_ 4\) subgraphs
• A prolific construction of strongly regular graphs with the \(n\)-e. c. property
• Which trees are link graphs?
• Graphs which contain all small graphs
• Graphs whose every independent set has a common neighbour
• Über ein Extremalproblem der Graphentheorie
• Paley graphs satisfy all first-order adjacency axioms
• Characterization of a class of triangle-free graphs with a certain adjacency property
• Universal graphs and universal functions
• On the construction of certain graphs
• The binding number of a graph and its Anderson number
• Asymmetric graphs
• A family of countable homogeneous graphs

This page was built for publication: Triply Existentially Complete Triangle‐Free Graphs