Universality vs genericity and \(C_4\)-free graphs

DOI10.1016/j.ejc.2022.103590zbMath1497.05233arXiv2104.13222OpenAlexW3159512109WikidataQ113875488 ScholiaQ113875488MaRDI QIDQ2674563

Aristotelis Panagiotopoulos, Katrin Tent

Publication date: 14 September 2022

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Models of other mathematical theories (03C65) Model theory of denumerable and separable structures (03C15) Categoricity and completeness of theories (03C35)

Related Items (1)

Games with finitely generated structures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some universal graphs
• Universal elements and the complexity of certain classes of infinite graphs
• Universal graphs with forbidden subgraphs and algebraic closure
• Games with finitely generated structures
• Bowtie-free graphs have a Ramsey lift
• Turbulence, amalgamation, and generic automorphisms of homogeneous structures
• Countable Ultrahomogeneous Undirected Graphs
• Generic expansions of ω-categorical structures and semantics of generalized quantifiers
• There is no universal countable pentagon‐free graph
• COHERENT EXTENSION OF PARTIAL AUTOMORPHISMS, FREE AMALGAMATION AND AUTOMORPHISM GROUPS
• WEAK SATURATION AND WEAK AMALGAMATION PROPERTY
• Universal graphs with a forbidden near‐path or 2‐bouquet
• Universal graphs and universal functions
• Some remarks on universal graphs
• Geodetic graphs of diameter two
• Some remarks on universal graphs
• On strongly regular graphs with \(\mu =1\)
• Examples of weak amalgamation classes

This page was built for publication: Universality vs genericity and \(C_4\)-free graphs