Related papers: Homotopy groups and quantitative Sperner-type lemm…

For positive integers $n,r,s$ with $r > s$, the set-coloring Ramsey number $R(n;r,s)$ is the minimum $N$ such that if every edge of the complete graph $K_N$ receives a set of $s$ colors from a palette of $r$ colors, then there is guaranteed…

A graph coloring has bounded clustering if each monochromatic component has bounded size. This paper studies such a coloring, where the number of colors depends on an excluded complete bipartite subgraph. This is a much weaker assumption…

In this master thesis, we extend results from classical simple homotopy theory to the world of stratified homotopy theory. To obtain a well-established framework to work in, we prove a series of results on two model categories of simplicial…

The paper deals with extremal problems concerning colorings of hypergraphs. By using a random recoloring algorithm we show that any $n$-uniform simple (i.e. every two distinct edges share at most one vertex) hypergraph $H$ with maximum edge…

A graph coloring has bounded clustering if each monochromatic component has bounded size. Equivalently, it is a partition of the vertices into induced subgraphs with bounded size components. This paper studies clustered colorings of graphs,…

A recent theorem by T. Barthel, M. Hausmann, N. Naumann, T. Nikolaus, J. Noel, and N. Stapleton says that if A is a finite abelian p-group of rank r, then any finite A-space X which is acyclic in the nth Morava K-theory with n at least r…

If $\G$ is a finitely generated group with generators $\{g_1,...,g_j\}$ then an infinite order element $f \in \G$ is a {\em distortion element} of $\G$ provided $\displaystyle{\liminf_{n \to \infty} |f^n|/n = 0,}$ where $|f^n|$ is the word…

Let N be a regular branched cover of a homology 3-sphere M with deck group G isomorphic to Z_2^d and branch set a trivalent graph Gamma; such a cover is determined by a coloring of the edges of Gamma with elements of G. For each index-2…

Let $F$ be a graph which contains an edge whose deletion reduces its chromatic number. For such a graph $F,$ a classical result of Simonovits from 1966 shows that every graph on $n\ge n_0(F)$ vertices with more than…

This is a treatise on finite point configurations spanning a fixed volume to be found in a single color-class of an arbitrary finite (measurable) coloring of the Euclidean space $\mathbb{R}^n$, or in a single large measurable subset…

We show that if $E$ is a $p$-local Landweber exact homology theory of height $n$ and $p > n^2+n+1$, then there exists an equivalence $h \mathcal{S}p_{E} \simeq h\mathcal{D}(E_{*}E)$ between homotopy categories of $E$-local spectra and…

Given a set $S$ of $n$ points in the plane, a \emph{radial ordering} of $S$ with respect to a point $p$ (not in $S$) is a clockwise circular ordering of the elements in $S$ by angle around $p$. If $S$ is two-colored, a \emph{colored radial…

As Goresky and MacPherson intersection homology is not the homology of a space, there is no preferred candidate for intersection homotopy groups. Here, they are defined as the homotopy groups of a simplicial set which P. Gajer associates to…

We interpret the number of good four-colourings of the faces of a trivalent, spherical polyhedron as the 2-holonomy of the 2-connection of a fibered category, phi, modeled on Rep(sl(2)) and defined over the dual triangulation, T. We also…

An asymmetric coloring of a graph is a coloring of its vertices that is not preserved by any non-identity automorphism of the graph. The motion of a graph is the minimal degree of its automorphism group, i.e., the minimum number of elements…

Suppose $\mu$ is a partition of $n$ and $\lambda$ a composition of $n$, and let $S^\mu$, $M^\lambda$ denote the Specht module and permutation module defined by Dipper and James for the Iwahori--Hecke algebra $\mathscr{H}_n$ of the symmetric…

We propose a graphical language that accommodates two monoidal structures: a multiplicative one for pairing and an additional one for branching. In this colored PROP, whether wires in parallel are linked through the multiplicative structure…

Let Q_K=(Q,<_Q)$ be a strongly K-dense linear order of size K for a suitable cardinal K. We prove, for all integers m > 1 that there is a finite value t_m^+ such that the set of all m-tuples from Q can be divided into t_m^+ many classes,…

We consider the so-called coupon-coloring of the vertices of a graph where every color appears in every open neighborhood, and our aim is to determine the maximal number of colors in such colorings. In other words, every color class must be…

One of the most fundamental problems in the theory of finite- dimensional Hopf algebras is their classification over an algebraically closed field k of characteristic 0. This problem is extremely difficult, hence people restrict it to…