Universal infinite clique-omitting graphs

Dzamonja, Mirna (2016) Universal infinite clique-omitting graphs. Sarajevo Journal of Mathematics, 12 (25) (2). pp. 151-154.

[thumbnail of Accepted manuscript]
PDF (Accepted manuscript) - Accepted Version
Download (211kB) | Preview


The main result of the paper is that when κ is a cardinal of cofi- nality ω and λ ≥ κ, the class of graphs of size λ omitting cliques of size κ has no universal element under graph homomorphisms (or the weak and strong embeddings). This theorem only requires ZF.

Item Type: Article
Faculty \ School: Faculty of Science > School of Mathematics
UEA Research Groups: Faculty of Science > Research Groups > Logic
Depositing User: Pure Connector
Date Deposited: 28 Sep 2016 15:00
Last Modified: 17 Oct 2022 13:32
URI: https://ueaeprints.uea.ac.uk/id/eprint/60626
DOI: 10.5644/SJM.12.2.02

Actions (login required)

View Item View Item