Related papers: Universal graphs without large cliques

This introduction to graphs and graph algebras provides the optimal bound for the number of all paths of length $k$ in a graph with $N\geq k$ edges and no loops. Our proof relies on a construction of a number of terminating algorithms that…

W.H. Woodin showed that if $\kappa_1 < \cdots < \kappa_n$ are strong cardinals then two-step ${\bf\Sigma}^1_{n+3}$ generic absoluteness holds after collapsing $2^{2^{\kappa_n}}$ to be countable. We show that this number can be reduced to…

Chris Lambie-Hanson proved recently that for every function $ f:\mathbb{N}\rightarrow \mathbb{N} $ there is an $ \aleph_1 $-chromatic graph $ G $ of size $ 2^{\aleph_1} $ such that every $ (n+3) $-chromatic subgraph of $ G $ has at least $…

Quantum symmetry of graph $C^{*}$-algebras has been studied, under the consideration of different formulations, in the past few years. It is already known that the compact quantum group $(\underbrace{C(S^{1})*C(S^{1})*\cdots…

We show a new proof for the fact that when $\kappa$ and $\lambda$ are infinite cardinals satisfying $\lambda ^ \kappa = \lambda$, the cofinality of the set of all functions from $\lambda$ to $\kappa$ ordered by everywhere domination is…

Call a colouring of a graph \emph{distinguishing} if the only automorphism of this graph which preserves said colouring is the identity. Let $H$ be an arbitrary graph. We say that a graph $G$ is \emph{$H$-free} if $G$ does not contain an…

In 1976 Erdos, Kleitman and Rothschild determined the number of graphs without a clique of size $\ell$. In this note we extend their result to the case of forbidden cliques of increasing size. More precisely we prove that for $\ell_n \le…

In this note we give a new upper bound for the Laplacian eigenvalues of an unweighted graph. Let $G$ be a simple graph on $n$ vertices. Let $d_{m}(G)$ and $\lambda_{m+1}(G)$ be the $m$-th smallest degree of $G$ and the $m+1$-th smallest…

A simple \(P_\lambda\)-point on a regular cardinal \(\kappa\) is a uniform ultrafilter on \(\kappa\) with a mod-bounded decreasing generating sequence of length \(\lambda\). We prove that if there is a simple $P_\lambda$-point ultrafilter…

Given a cardinal $\kappa$ that is $\lambda$-supercompact for some regular cardinal $\lambda\geq\kappa$ and assuming $\GCH$, we show that one can force the continuum function to agree with any function $F:[\kappa,\lambda]\cap\REG\to\CARD$…

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…

It is shown that for a given infinite graph $G$ on countably many vertices, and a compact, infinite set of real numbers $\Lambda$ there is a real symmetric matrix $A$ whose graph is $G$ and its spectrum is $\Lambda$. Moreover, the set of…

Let T be an abelian group and lambda an uncountable regular cardinal. We consider the question of whether there is a lambda-universal group G^* among all torsion-free abelian groups G of cardinality less than or equal to lambda satisfying…

For a cardinal $\kappa > \omega$ a metric space $X$ is called to be $\kappa$-superuniversal whenever for every metric space $Y$ with $|Y| < \kappa$ every partial isometry from a subset of $Y$ into $X$ can be extended over the whole space…

The Kalikow problem for a pair (lambda, kappa) of cardinal numbers, lambda > kappa (in particular kappa =2) is whether we can map the family of omega --sequences from lambda to the family of omega --sequences from kappa in a very continuous…

For a multi-set $\lambda=\{k_1,k_2, \ldots, k_q\}$ of positive integers, let $k_{\lambda} = \sum_{i=1}^q k_i$. A $\lambda$-list assignment of $G$ is a list assignment $L$ of $G$ such that the colour set $\bigcup_{v \in V(G)}L(v)$ can be…

The generalized connectivity of a graph, which was introduced recently by Chartrand et al., is a generalization of the concept of vertex connectivity. Let $S$ be a nonempty set of vertices of $G$, a collection $\{T_1,T_2,...,T_r\}$ of trees…

We show that the number of entire maximal graphs with finitely many singular points that are conformally equivalent is a universal constant that depends only on the number of singularities, namely 2^$ for graphs with n+1 singularities. We…

Huynh et al. recently showed that a countable graph $G$ which contains every countable planar graph as a subgraph must contain arbitrarily large finite complete graphs as topological minors, and an infinite complete graph as a minor. We…

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}$…