Related papers: No universal graphs at uncountable regular cardina…

We show in ZFC that there is no set of reals of size continuum which can be translated away from every set in the Marczewski ideal. We also show that in the Cohen model, every set with this property is countable.

Let kappa be an uncountable regular cardinal. Assuming 2^kappa=kappa^+, we show that the clone lattice on a set of size kappa is not dually atomic.

Kunen's proof of the non-existence of Reinhardt cardinals opened up the research on very large cardinals, i.e., hypotheses at the limit of inconsistency. One of these large cardinals, I0, proved to have descriptive-set-theoretical…

It is consistent relative to an inaccessible cardinal that ZF+DC holds, the hypergraph of equilateral triangles on a given Euclidean space has countable chromatic number, while the hypergraph of isosceles triangles in the plane does not.

In this paper it is introduced a generic large cardinal akin to I0, and its consequences are analyzed in the case that $\aleph_\omega$ is such a generic large cardinal. In this case $\aleph_\omega$ is J\'{o}nsson, and in a choiceless inner…

For every uncountable cardinal mu there is a ccc Boolean algebra whose topological density is mu .

An E-ring is a unital ring R such that every endomorphism of the underlying abelian group R^+ is multiplication by some ring-element. The existence of almost-free E-rings of cardinality greater than 2^{aleph_0} is undecidable in ZFC. While…

Let kappa be a regular uncountable cardinal and lambda > kappa a singular strong limit cardinal. We give a new characterization of the nonstationary subsets of P_kappa (lambda) and use this to prove that the nonstationary ideal on P_kappa…

We show that for any natural number $s$, there is a constant $\gamma$ and a subgraph-closed class having, for any natural $n$, at most $\gamma^n$ graphs on $n$ vertices up to isomorphism, but no adjacency labeling scheme with labels of size…

We study the possible number of normal measures on a measurable cardinal in settings where inner model techniques are unavailable. Instead, we exploit consequences of the Ultrapower Axiom to obtain our theorems. We show that the classical…

In S. 1 we deal with amalgamation bases, e.g., we define when an a.e.c. $k$ has $(\lambda,\kappa)$-amalgamation which means "many" M in $K^k_\lambda$ are amalgamation bases. We then consider what happens for the class of lf groups. In S. 2…

We prove that an inseparable graph can have any positive number of cycles with the six exceptions 2, 4, 5, 8, 9, 16, and that an inseparable cubic graph has the additional exceptions 1 and 13. The exceptions for simple inseparable cubic…

The aim of this paper is to consider questions concerning the possible maximum cardinality of various separable pseudoradial (in short: SP) spaces. The most intriguing question here is if there is, in ZFC, a regular (or just Hausdorff) SP…

We introduce the following weak version of Hadwiger's conjecture: If $G$ is a graph and $\kappa$ is a cardinal such that there is no coloring map $c:G \to \kappa$, then $K_\kappa$ is a minor of $G$. We prove that this statement is true for…

The article starts with some introductory material about resolution graphs of normal surface singularities (definitions, topological/homological properties, etc). We then discuss the case when the normal surface singularity is an N-fold…

We prove that if $\lambda$ is a fixed uncountable cardinal and $f = \langle \ka_{\al} : \al < \delta \rangle$ is a sequence of infinite cardinals where $\delta < \omega_3$ and $\ka_{\al}\in \{\om,\lambda\}$ for each $\al < \delta$ in such a…

The problem of characterizing maximal non-Hamiltonian graphs may be naturally extended to characterizing graphs that are maximal with respect to non-traceability and beyond that to $t$-path traceability. We show how traceability behaves…

We prove that for infinite cardinals $\kappa<\lambda$ the alternating group $Alt(\lambda)$ (of even permutations) of $\lambda$ is not embeddable into the symmetric group $Sym(\kappa)$ (of all permutations) of $\kappa$. To prove this fact we…

We construct in ZFC a countably compact group without non-trivial convergent sequences of size $2^{\mathfrak{c}}$, answering a question of Bellini, Rodrigues and Tomita. We also construct in ZFC a selectively pseudocompact group which is…

A graph H is called common if the total number of copies of H in every graph and its complement asymptotically minimizes for random graphs. A former conjecture of Burr and Rosta, extending a conjecture of Erdos asserted that every graph is…