Related papers: A note on highly connected and well-connected Rams…
Ramsey's theorem, in the version of Erd\H{o}s and Szekeres, states that every 2-coloring of the edges of the complete graph on {1, 2,...,n} contains a monochromatic clique of order 1/2\log n. In this paper, we consider two well-studied…
In this paper we continue the study of the higher-rank graphs associated to finite-dimensional complex semisimple Lie algebras, introduced by the author and R. Yuncken, whose construction relies on Kashiwara's theory of crystals. First we…
It is proved that every singular cardinal $\lambda$ admits a function $RTS:[\lambda^+]^2\rightarrow[\lambda^+]^2$ that transforms rectangles into squares. Namely, for every cofinal subsets $A,B$ of $\lambda^+$, there exists a cofinal subset…
Our main result is a robust generalisation of the Cockayne-Lorimer theorem on the multicolour Ramsey number of matchings. It is moreover a generalisation of the transference generalisation of Cockayne-Lorimer, which (informally) says that…
The multicolor Ramsey number problem asks, for each pair of natural numbers $\ell$ and $t$, for the largest $\ell$-coloring of a complete graph with no monochromatic clique of size $t$. Recent works of Conlon-Ferber and Wigderson have…
We develop a bipartite rigidity theory for bipartite graphs parallel to the classical rigidity theory for general graphs, and define for two positive integers $k,l$ the notions of $(k,l)$-rigid and $(k,l)$-stress free bipartite graphs. This…
Many inequality relations between real vector quantities can be succinctly expressed as "weak (sub)majorization" relations. We explain these ideas and apply them in several areas: angles between subspaces, Ritz values, and graph Laplacian…
In this article we study higher homological properties of $n$-levelled algebras and connect them to properties of the underlying graphs. Notably, to each $2$-representation-finite quadratic monomial algebra $\Lambda$ we associate a…
We study the structured rainbow Ramsey theory at uncountable cardinals. When compared to the usual rainbow Ramsey theory, the variation focuses on finding a rainbow subset that not only is of a certain cardinality but also satisfies certain…
The stable Ramsey's theorem for pairs has been the subject of numerous investigations in mathematical logic. We introduce a weaker form of it by restricting from the class of all stable colorings to subclasses of it that are non-null in a…
Consider a bipartite random geometric graph on the union of two independent homogeneous Poisson point processes in $d$-space, with distance parameter $r$ and intensities $\lambda,\mu$. We show for $d \geq 2$ that if $\lambda$ is…
Generalizing well-known results of Erd\H{o}s and Lov\'asz, we show that every graph $G$ contains a spanning $k$-partite subgraph $H$ with $\lambda{}(H)\geq \lceil{}\frac{k-1}{k}\lambda{}(G)\rceil$, where $\lambda{}(G)$ is the…
The central theorem of topological graph theory states that the graph minor relation is a well-quasi-order on graphs. It has far-reaching consequences, in particular in the study of graph structures and the design of (parameterized)…
We show that it is consistent relative to a weakly compact cardinal that strong homology is additive and compactly supported within the class of locally compact separable metric spaces. This complements work of Marde\v{s}i\'{c} and Prasolov…
Conventional Ramsey-theoretic investigations for edge-colourings of complete graphs are framed around avoidance of certain configurations. Motivated by considerations arising in the field of Qualitative Reasoning, we explore edge colourings…
A $h$-sunflower in a hypergraph is a family of edges with $h$ vertices in common. We show that if we colour the edges of a complete hypergraph in such a way that any monochromatic $h$-sunflower has at most $\lambda$ petals, then it contains…
For $r:=(r_1,\dots,r_k)$, an $r$-factorization of the complete $\lambda$-fold $h$-uniform $n$-vertex hypergraph $\lambda K_n^h$ is a partition of (the edges of) $\lambda K_n^h$ into $F_1,\dots, F_k$ such that for $i=1,\dots,k$, $F_i$ is…
We discuss quantum graphs consisting of a compact part and semiinfinite leads. Such a system may have embedded eigenvalues if some edge lengths in the compact part are rationally related. If such a relation is perturbed these eigenvalues…
The Abu-Khzam--Langston conjecture, that is the weak-immersion analogue of Hadwiger's conjecture and a weak version of an earlier conjecture of Lescure and Meyniel, asserts that every graph $G$ contains a weak immersion of $K_{\chi(G)}$. We…
We give a new interpretation of the shifted Littlewood-Richardson coefficients $f_{\lambda\mu}^\nu$ ($\lambda,\mu,\nu$ are strict partitions). The coefficients $g_{\lambda\mu}$ which appear in the decomposition of Schur $Q$-function…