Related papers: Graphs and $({\Bbb Z}_2)^k$-actions

Motivated by the theory of Riemann surfaces, we classify all possibilities for finite simple groups acting faithfully on a compact Riemann surface of genus at least 2 in such a way that all non-trivial elements have at most three fixed…

We define $A_k$-moves for embeddings of a finite graph into the 3-sphere for each natural number $k$. Let $A_k$-equivalence denote an equivalence relation generated by $A_k$-moves and ambient isotopy. $A_k$-equivalence implies…

A graph $G$ is 3-colorable if and only if it maps homomorphically to the complete 3-vertex graph $K_3$. The last condition can be checked by a $k$-consistency algorithm where the parameter $k$ has to be chosen large enough, dependent on…

We prove a compactness theorem for sequences of low-action punctured holomorphic curves of controlled topology, in any dimension, without imposing the typical assumption of uniformly bounded Hofer energy. In the limit, we extract a family…

We obtain lower bounds for the dimension of fixed loci of diagonalizable $p$-groups acting on smooth projective varieties. Those bounds depend on the modulo $p$ Chern numbers of the ambient variety, and are expressed in a natural way by…

We discover new linear relations between the chromatic symmetric functions of certain sequences of graphs and apply these relations to find new families of e-positive unit interval graphs. Motivated by the results of Gebhard and Sagan, we…

For a graph $G$, let $c_k(G)$ be the number of spanning trees of $G$ with maximum degree at most $k$. For $k \ge 3$, it is proved that every connected $n$-vertex $r$-regular graph $G$ with $r \ge \frac{n}{k+1}$ satisfies $$ c_k(G)^{1/n} \ge…

We determine all restrictions on the dimension of the fixed locus of a diagonalizable group acting on a smooth projective variety that arise from the Chern numbers of the ambient variety. We reduce the problem to finding lower bounds for…

A topological graph is \emph{$k$-quasi-planar} if it does not contain $k$ pairwise crossing edges. A topological graph is \emph{simple} if every pair of its edges intersect at most once (either at a vertex or at their intersection). In…

Let $P_G(k)$ be the number of proper $k$-colorings of a finite simple graph $G$. Tomescu's conjecture, which was recently solved by Fox, He, and Manners, states that $P_G(k) \le k!(k-1)^{n-k}$ for all connected graphs $G$ on $n$ vertices…

This is a slightly altered version of the authors thesis from 2014. In the first main part we show that the quotient space of a compact, simply connected and nonnegatively curved Riemannian 4-manifold by an effective, isometric…

We say that two graphs $H_1,H_2$ on the same vertex set are $G$-creating ($G$-different in other papers, this difference is explained in the introduction) if the union of the two graphs contains $G$ as a subgraph. Let $H(n,k)$ be the…

In this paper, we first study a new extremal problem recently posed by Conlon and Tyomkyn~(arXiv: 2002.00921). Given a graph $H$ and an integer $k\geqslant 2$, let $f_{k}(n,H)$ be the smallest number of colors $c$ such that there exists a…

Every finite graph admits a \emph{simple (topological) drawing}, that is, a drawing where every pair of edges intersects in at most one point. However, in combination with other restrictions simple drawings do not universally exist. For…

Let $X$ be a smooth irreducible projective variety over a field $\mathbf{k}$ of dimension $d.$ Let $\tau: \mathbb{Q}_l\to \mathbb{C}$ be any field embedding. Let $f: X\to X$ be a surjective endomorphism. We show that for every…

We introduce the idea of an n-simplex graph and games upon simplicial complexes. We then define moves on a labeled graph and pose the problem of whether given two labelings of a graph it is possible to change one into another via these…

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…

The problem of finding the minimum number of colors to color a graph properly without containing any bicolored copy of a fixed family of subgraphs has been widely studied. Most well-known examples are star coloring and acyclic coloring of…

We solve four similar problems: For every fixed $s$ and large $n$, we describe all values of $n_1,\ldots,n_s$ such that for every $2$-edge-coloring of the complete $s$-partite graph $K_{n_1,\ldots,n_s}$ there exists a monochromatic (i)…

Given a GKM$_3$ action of a torus $K$ on a manifold $M$ with GKM graph $\Gamma$, we show that for any extension of $\Gamma$ to an abstract GKM graph the corresponding restriction map in equivariant graph cohomology is surjective. While the…