Open AccessUNIVERSAL INFINITE CLIQUE-OMITTING GRAPHS
Author(s) -
Mirna Džamonja
Publication year - 2016
Publication title -
sarajevo journal of mathematics
Language(s) - English
Resource type - Journals
eISSN - 2233-1964
pISSN - 1840-0655
DOI - 10.5644/sjm.12.2.02
Subject(s) - mathematics , clique , combinatorics , clique number , graph
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
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom