Universal infinite clique-omitting graphs
Tools
Tools
ToolsDzamonja, Mirna (2016) Universal infinite clique-omitting graphs. Sarajevo Journal of Mathematics, 12 (25) (2). pp. 151-154.
![[img]](https://ueaeprints.uea.ac.uk/style/images/fileicons/application_pdf.png)
|
PDF (Accepted manuscript)
- Submitted Version
Download (211kB) | Preview |
Abstract
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 |
| Depositing User: | Pure Connector |
| Date Deposited: | 28 Sep 2016 15:00 |
| Last Modified: | 22 Apr 2020 01:46 |
| URI: | https://ueaeprints.uea.ac.uk/id/eprint/60626 |
| DOI: | 10.5644/SJM.12.2.02 |
Actions (login required)
 |
View Item |