4 citations · 8 across the 6 of their papers we have counts for
6 papers
Finite subgraphs of uncountably chromatic graphs
Péter Komjáth, Saharon Shelah
It is consistent that for every monotonically increasing function f:omega->omega there is a graph with size and chromatic number aleph_1 in which every n-chromatic subgraph has at…
A partition theorem for scattered order types
Peter Komjath, Saharon Shelah
If phi is a scattered order type, mu a cardinal, then there exists a scattered order type psi such that psi->[phi]^1_{mu,aleph_0} holds.
Consistency of the existence of a 4-place function on aleph_2 with no independent subset of size k_n
Peter Komjath, Saharon Shelah
It is consistent that there is a set mapping from the four-tuples of omega_n into the finite subsets with no free subsets of size t_n for some natural number t_n. For any n< omega…
Coloring finite subsets of uncountable sets
Peter Komjath, Saharon Shelah
It is consistent for every (1 <= n< omega) that (2^omega = omega_n) and there is a function (F:[omega_n]^{< omega}-> omega) such that every finite set can be written at most (2^n-1…
On uniformly antisymmetric functions
Peter Komjath, Saharon Shelah
We show that there is always a uniformly antisymmetric f:A-> {0,1} if A subset R is countable. We prove that the continuum hypothesis is equivalent to the statement that there is a…
Universal graphs without large cliques
Peter Komjath, Saharon Shelah
We give some existence/nonexistence statements on universal graphs, which under GCH give a necessary and sufficient condition for the existence of a universal graph of size lambda…