27 citations · 105 across the 60 of their papers we have counts for
71 papers
Hedetniemi's Conjecture for Uncountable Complementary Graphs
Lajos Soukup
We study the complementary version of Hedetniemi's problem for infinite graphs. We prove that if a graph and its complement are both uncountably chromatic while…
Pseudocompact versus countably compact in first countable spaces
István Juhász, Ljos Soukup, Zoltán Szentmiklóssy
The primary objective of this work is to construct spaces that are "pseudocompact but not countably compact," abbreviated as PNC, while endowing them with additional properties. Fi…
The class and countable net weight
István Juhász, Lajos Soukup, Zoltán Szentmiklóssy
Hart and Kunen, and independently in the recent preprint arXiv:2304.13113, Ríos-Herrejón defined and studied the class of topological spaces having the property that f…
On resolvability of products
István Juhász, Lajos Soukup, Zoltán Szentmiklóssy
All spaces below are and crowded (i.e. have no isolated points). For let be the statement that there are measurable cardinals and () that…
Infinite Combinatorics revisited in the absence of Axiom of Choice
Tamás Csernák, Lajos Soukup
We investigate the provability of classical combinatorial theorems in ZF. Using combinatorial arguments, we establish the following results for each infinite cardinal , (1…
Constructions of Lindelöf scattered P-spaces
Juan Carlos Martínez, Lajos Soukup
We construct locally Lindelöf scattered P-spaces (LLSP spaces, in short) with prescribed widths and heights under different set-theoretic assumptions. We prove that there is an LLS…