相关论文: A tree--arrowing graph

For infinite cardinals $\kappa,\lambda$ let $C(\kappa,\lambda)$ denote the class of all compact Hausdorff spaces of weight $\kappa$ and size $\lambda$. So $C(\kappa,\lambda)=\emptyset$ if $\kappa>\lambda$ or $\lambda>2^\kappa$. If F is a…

The current paper answers an open question of abs/1007.2426 We say that a countable model M characterizes an infinite cardinal kappa, if the Scott sentence of M has a model in cardinality kappa, but no models in cardinality kappa plus. If M…

We prove that the existence of a non-special tree of size $\lambda$ is equivalent to the existence of an uncountably chromatic graph with no $K_{\omega_1}$ minor of size $\lambda$, establishing a connection between the special tree number…

Let $\phi(k)$ be the minimum number of vertices in a non-$k$-choosable $k$-chromatic graph. The Ohba conjecture, confirmed by Noel, Reed and Wu, asserts that $\phi(k) \ge 2k+2$. This bound is tight if $k$ is even. If $k$ is odd, then it is…

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…

Assuming the existence of a strong cardinal $\kappa$ and a measurable cardinal above it, we force a generic extension in which $\kappa$ is a singular strong limit cardinal of any prescribed cofinality, and such that the tree property holds…

We study conditions on automorphisms of Boolean algebras of the form $P(\lambda)/I_\kappa$ (where $\lambda$ is an uncountable cardinal and $I_\kappa$ is the ideal of sets of cardinality less than $\kappa$) which allow one to conclude that a…

Assuming 0^sharp does not exist, kappa is an uncountable cardinal and for all cardinals lambda with kappa <= lambda < kappa^{+ omega}, 2^lambda = lambda^+, we present a ``mini-coding'' between kappa and kappa^{+ omega}. This allows us to…

The $(\kappa,\ell)$-edge-inducibility problem asks for the maximum number of $\kappa$-subsets inducing exactly $\ell$ edges that a graph of given order $n$ can have. Using flag algebras and stability approach, we resolve this problem for…

Let $\kappa$ be any regular cardinal. Assuming the existence of a huge cardinal above $\kappa$, we prove the consistency of $\binom{\kappa^{++}}{\kappa^+}\rightarrow\binom{\tau}{\kappa^+}$ for every ordinal $\tau<\kappa^{++}$. Likewise, we…

Let $\Gamma$ be an Abelian group and let $G$ be a simple graph. We say that $G$ is $\Gamma$-colorable if for some fixed orientation of $G$ and every edge labeling $\ell:E(G)\rightarrow \Gamma$, there exists a vertex coloring $c$ by the…

A coloring of a graph G = (V,E) is a partition {V1, V2, . . ., Vk} of V into independent sets or color classes. A vertex v Vi is a Grundy vertex if it is adjacent to at least one vertex in each color class Vj . A coloring is a Grundy…

We investigate the infinite version of the $k$-switch problem of Greenwell and Lov\'asz. Given infinite cardinals ${\kappa}$ and ${\lambda}$, for functions $x,y\in {}^{\lambda}\kappa $ we say that they are totally different if $x(i)\ne…

For a finite graph $\Gamma$, let $G(\Gamma)$ be the right-angled Artin group defined by the complement graph of $\Gamma$. We show that, for any linear forest $\Lambda$ and any finite graph $\Gamma$, $G(\Lambda)$ can be embedded into…

We show that the edges of any graph $G$ containing two edge-disjoint spanning trees can be blue/red coloured so that the blue and red graphs are connected and the blue and red degrees at each vertex differ by at most four. This improves a…

We introduce a new compactness principle which we call the gluing property. For a measurable cardinal $\kappa$ and a cardinal $\lambda$, we say that $\kappa$ has the $\lambda$-gluing property if every sequence of $\lambda$-many…

Motivated by recent results and questions of D. Raghavan and S. Shelah, we present ZFC theorems on the bounding and various almost disjointness numbers, as well as on reaping and dominating families on uncountable, regular cardinals. We…

In the noisy channel model from coding theory, we wish to detect errors introduced during transmission by optimizing various parameters of the code. Bennett, Dudek, and LaForge framed a variation of this problem in the language of…

We study the problem of coloring a given graph using a small number of colors in several well-established models of computation for big data. These include the data streaming model, the general graph query model, the massively parallel…

For a pair of natural numbers $k, l$, a $(k,l)$-colouring of a graph $G$ is a partition of the vertex set of $G$ into (possibly empty) sets $S_1, S_2, \dots, S_k$, $C_1, C_2, \dots, C_l$ such that each set $S_i$ is an independent set and…