Related papers: Hall's theorem for reconfigurations and higher dim…
We demonstrate that the topological Helly theorem and the algebraic Auslander-Buchsbaum may be viewed as different versions of the same phenomenon. Using this correspondence we show how the colorful Helly theorem of I.Barany and its…
For a fixed graph $H$, the reconfiguration problem for $H$-colourings (i.e. homomorphisms to $H$) asks: given a graph $G$ and two $H$-colourings $\varphi$ and $\psi$ of $G$, does there exist a sequence $f_0,\dots,f_m$ of $H$-colourings such…
This work is concerned with an axiom introduced by Todorc\v{e}vi\'{c} in \cite{stevo} that constitutes a Ramsey-like statement regarding the topology of the reals. Our aim is to explain the axiom in detail, give some interesting…
We supply an upper bound on the distinguishing chromatic number of certain infinite graphs satisfying an adjacency property. Distinguishing proper $n$-colourings are generalized to the new notion of distinguishing homomorphisms. We prove…
Working in the context of symmetric spectra, we describe and study a homotopy completion tower for algebras and left modules over operads in the category of modules over a commutative ring spectrum (e.g., structured ring spectra). We prove…
Recent results show that the structural similarity of graphs can be characterized by counting homomorphisms to them: the Tree Theorem states that the well-known color-refinement algorithm does not distinguish two graphs G and H if and only…
Given a simplicial complex and a collection of subcomplexes covering it, the nerve theorem, a fundamental tool in topological combinatorics, guarantees a certain connectivity of the simplicial complex when connectivity conditions on the…
We provide a degree condition on a regular $n$-vertex graph $G$ which ensures the existence of a near optimal packing of any family $\mathcal H$ of bounded degree $n$-vertex $k$-chromatic separable graphs into $G$. In general, this degree…
The colored Tverberg theorem asserts that for every d and r there exists t=t(d,r) such that for every set C in R^d of cardinality (d+1)t, partitioned into t-point subsets C_1,C_2,...,C_{d+1} (which we think of as color classes; e.g., the…
The Lov\'asz Local Lemma is a powerful probabilistic technique for proving the existence of combinatorial objects. It is especially useful for colouring graphs and hypergraphs with bounded maximum degree. This paper presents a general…
We apply the local removable singularity theorem for minimal laminations and the local picture theorem on the scale of topology to obtain two descriptive results for certain possibly singular minimal laminations of $\mathbb{R}^3$. These two…
Given a proper (list) colouring of a graph $G$, a recolouring step changes the colour at a single vertex to another colour (in its list) that is currently unused on its neighbours, hence maintaining a proper colouring. Suppose that each…
In this paper, a theorem is proved that generalizes several existing amalgamation results in various ways. The main aim is to disentangle a given edge-colored amalgamated graph so that the result is a graph in which the edges are shared out…
We establish a colorful and, more generally, matroidal solution to the problem of Goodman and Pollack on the existence of an $\mathbb{F}$-affine $k$-dimensional transversal to a family of convex sets in $\mathbb{F}^d$, where $0 \le k \le d…
A celebrated but non-effective theorem of Tibor Gallai states that for any finite set $A$ of $\Z^n$ and for any finite number of colors $c$ there is a minimal $m$ such that no coloring of the finite $m^n$-grid can avoid that a homothetic…
We develop a method to study sufficient conditions for perfect mixed tilings. Our framework allows the embedding of bounded degree graphs $H$ with components of sublinear order. As a corollary, we recover and extend the work of K\"uhn and…
The proof uses the property that the vertices of a triangulated planar graph can be four coloured if the triangles can have a +1 or -1 orientation so that the sum of the triangle orientations around each vertex is a multiple of 3. Such…
We prove a new generalisation of Ramsey's theorem by showing that every $2$-edge-coloured graph with sufficiently large minimum degree contains a monochromatic induced subgraph whose minimum degree remains large. From this, we also derive…
A graph H is t-apex if H-X is planar for some subset X of V(H) of size t. For any integer t>=0 and a fixed t-apex graph H, we give a polynomial-time algorithm to decide whether a (t+3)-connected H-minor-free graph is colorable from a given…
A well-known result by Haxell and Kohayakawa states that the vertices of an $r$-coloured complete graph can be partitioned into $r$ monochromatic connected subgraphs of distinct colours; this is a slightly weaker variant of a conjecture by…