相关论文: On Taylor's problem

Given two infinite cardinals $\kappa$ and $\lambda$, we introduce and study the notion of a $\kappa$-barely independent family over $\lambda.$ We provide some conditions under which these types of families exist. In particular, we relate…

We give another proof that for every lambda >= beth_omega for every large enough regular kappa < beth_omega we have lambda^{[kappa]}= lambda, dealing with sufficient conditions for replacing beth_omega by aleph_omega. In section 2 we show…

A class K of structures is controlled if, for all cardinals lambda, the relation of L_{infty,lambda}-equivalence partitions K into a set of equivalence classes (as opposed to a proper class). We prove that the class of doubly transitive…

Suppose that kappa is a singular cardinal of cofinality omega and GCH holds. Assume that for every n<omega the set of alphas with o(alpha)>= alpha^{+n} is unbounded in kappa.Then there is a cardinal preserving extension satisfying…

We prove that for all integers $\Delta,r \geq 2$, there is a constant $C = C(\Delta,r) >0$ such that the following is true for every sequence $\mathcal{F} = \{F_1, F_2, \ldots\}$ of graphs with $v(F_n) = n$ and $\Delta(F_n) \leq \Delta$,…

Can a non self-complementary graph have the same chromatic polynomial as its complement? The answer to this question of Akiyama and Harrary is positive and was given by J. Xu and Z. Liu. They conjectured that every such graph has the same…

We apply model theoretic methods to the problem of existence of countable universal graphs with finitely many forbidden connected subgraphs. We show that to a large extent the question reduces to one of local finiteness of an…

Let $(\mathcal{K} ,\subseteq )$ be a universal class with $LS(\mathcal{K})=\lambda$ categorical in regular $\kappa >\lambda^+$ with arbitrarily large models, and let $\mathcal{K}^*$ be the class of all $\mathcal{A}\in\mathcal{K}_{>\lambda}$…

For every integer $r\ge3$ and every $\eps>0$ we construct a graph with maximum degree $r-1$ whose circular total chromatic number is in the interval $(r,r+\eps)$. This proves that (i) every integer $r\ge3$ is an accumulation point of the…

Let $K_4^+$ be the 5-vertex graph obtained from $K_4$, the complete graph on four vertices, by subdividing one edge precisely once (i.e. by replacing one edge by a path on three vertices). We prove that if the chromatic number of some graph…

Let $\mathcal{F}=\{F_{\alpha}: \alpha\in \mathcal{A}\}$ be a family of infinite graphs, together with $\Lambda$. The Factorization Problem $FP(\mathcal{F}, \Lambda)$ asks whether $\mathcal{F}$ can be realized as a factorization of…

We prove that consistently, cov($\mathcal{M})< \lambda_\mathbf{0} < \lambda_\mathbf{1} < \lambda_\mathbf{\infty} < 2^{\aleph_0}$, where $\lambda_\mathbf{0}$ denotes the weak Borel chromatic number of the Kechris-Solecki-Todor\v{c}evi\'c…

In 1984, Ditor asked two questions: (1) For each $n\in\omega$ and infinite cardinal $\kappa$, is there a join-semilattice of breadth $n+1$ and cardinality $\kappa^{+n}$ whose principal ideals have cardinality $< \kappa$? (2) For each $n \in…

We investigate in ZFC what can be the family of large enough cardinals mu in which an a.e.c. K is categorical or even just solvable. We show that for not few cardinals lambda<mu there is a superlimit model in K_lambda. Moreover, our main…

Let $K_n$ be the complete graph with $n$ vertices and $c_1, c_2, ..., c_r$ be $r$ different colors. Suppose we randomly and uniformly color the edges of $K_n$ in $c_1, c_2, ..., c_r$. Then we get a random graph, denoted by…

It is proved that for each natural number $n$, if $\left| \mathbb{R} \right| = {\aleph}_{n}$, then there is a coloring of ${\left[ \mathbb{R} \right]}^{n+2}$ into ${\aleph}_{0}$ colors that takes all colors on ${\left[ X \right]}^{n+2}$…

We consider unavoidable chromatic patterns in $2$-colorings of the edges of the complete graph. Several such problems are explored being a junction point between Ramsey theory, extremal graph theory (Tur\'an type problems), zero-sum Ramsey…

A countable graph is ultrahomogeneous if every isomorphism between finite induced subgraphs can be extended to an automorphism. Woodrow and Lachlan showed that there are essentially four types of such countably infinite graphs: the random…

\noindent In this paper, we show that for any positive integers $r$, $k$, $\Theta$, and $\Gamma$ such that $k \geq 2$ and $r \geq k + \Gamma$, there exists a connected graph $G$ for which $$\begin{array}{llcr} \omega (G) = \chi (G) = k, &…

In this paper we give a complete description of K-theory groups for Cuntz-Krieger C*-algebras associated to general locally-finite (topologically connected) graphs via Bass-Hashimoto operator. Our result generalizes the one obtained by the…