Related papers: On universal graphs without cliques or withour lar…

It was proved by Huynh, Mohar, \v{S}\'amal, Thomassen and Wood in 2021 that any countable graph containing every countable planar graph as a subgraph has an infinite clique minor. We prove a finite, quantitative version of this result: for…

Consider a graph $G$ on $n$ vertices with $\alpha \binom{n}{2}$ edges which does not contain an induced $K_{2, t}$ ($t \geqslant 2$). How large does $\alpha$ have to be to ensure that $G$ contains, say, a large clique or some fixed subgraph…

We show that the countable universal omega-categorical bowtie-free graph admits generic automorphisms. Moreover, we show that this graph is not finitely homogenisable.

We study the existence of infinite cliques in omega-automatic (hyper-)graphs. It turns out that the situation is much nicer than in general uncountable graphs, but not as nice as for automatic graphs. More specifically, we show that every…

In contrast to the usual quantum systems which have at most a finite number of open spectral gaps if they are periodic in more than one direction, periodic quantum graphs may have gaps arbitrarily high in the spectrum. This property of…

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…

Global control offers a promising route to scalable quantum computing. A recent conjecture by Hu et al. (arXiv:2508.19075) proposes that any connected qubit graph equipped with global Ising-type interactions and tunable global transverse…

A simplified construction is presented for Komj\'ath's result that for every uncountable cardinal $\kappa$, there are $2^\kappa$ graphs of size $\kappa$ none of them being a minor of another.

For each uniformity $k \geq 3$, we construct $k$-uniform linear hypergraphs $G$ with arbitrarily large maximum degree $\Delta$ whose independence polynomial $Z_G$ has a root $\lambda$ with $\lvert\lambda\rvert = O\left(\frac{\log…

In [6] we proved that the universal theory of infinite free lattices is (algorithmically) decidable, leaving open the problem of decidability of the full theory of an (infinite) free lattice. We solve this problem by proving that, for every…

We show that the existence of a universal countably chromatic graph of size $\aleph_1$ together with the failure of continuum hypothesis is consistent. The proof is a forcing iteration of strongly proper ccc posets. The construction works…

Let $\triangleleft$ be a relation between graphs. We say a graph $G$ is \emph{$\triangleleft$-ubiquitous} if whenever $\Gamma$ is a graph with $nG \triangleleft \Gamma$ for all $n \in \mathbb{N}$, then one also has $\aleph_0 G \triangleleft…

In this paper we disprove a conjecture of Lidick\'y and Murphy about the number of copies of a given graph in a $K_r$-free graph and give an alternative general conjecture. We also prove an asymptotically tight bound on the number of copies…

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…

The paper is concerned with the existence of a universal graph at the successor of a strong limit singular mu of cofinality aleph_0. Starting from the assumption of the existence of a supercompact cardinal, a model is built in which for…

We show that for any uncountable cardinal $\lambda$, the category of sets of cardinality at least $\lambda$ and monomorphisms between them cannot appear as the category of point of a topos, in particular is not the category of models of a…

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…

The generalized $k$-connectivity $\kappa_k(G)$ of a graph $G$ was introduced by Chartrand et al. in 1984. It is natural to introduce the concept of generalized $k$-edge-connectivity $\lambda_k(G)$. For general $k$, the generalized…

Let lambda be aleph_0 or a strong limit of cofinality aleph_0. Suppose that (G_m,p_{m,n}:m =< n<omega) and (H_m,p^t_{m,n}: m=< n < omega) are projective systems of groups of cardinality less than lambda and suppose that for every n<omega…

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…