Related papers: Estimating trisection genus via gem theory

Let $G$ be a finite group, and let $X$ be a smooth, orientable, connected, closed 4-dimensional $G$-manifold. Let $\mathcal{S}$ be a smooth, embedded, $G$-invariant surface in $X$. We introduce the concept of a $G$-equivariant trisection of…

Given a closed four-manifold $X$ with an indefinite intersection form, we consider smoothly embedded surfaces in $X \setminus $int$(B^4)$, with boundary a knot $K \subset S^3$. We give several methods to bound the genus of such surfaces in…

Gay and Kirby introduced the notion of a trisection of a smooth 4-manifold, which is a decomposition of the 4-manifold into three elementary pieces. Rubinstein and Tillmann later extended this idea to construct multisections of…

We define a trisection of a closed, orientable three dimensional manifold into three handlebodies, and a notion of stabilization for these trisections. Several examples of trisections are described in detail. We define the trisection genus…

This work derives an upper bound on the maximum cardinality of a family of graphs on a fixed number of vertices, in which the intersection of every two graphs in that family contains a subgraph that is isomorphic to a specified graph H.…

The widely studied edge modification problems ask how to minimally alter a graph to satisfy certain structural properties. In this paper, we introduce and study a new edge modification problem centered around transforming a given graph into…

We present an algorithm taking a Kirby diagram of a closed oriented $4$-manifold to a trisection diagram of the same manifold. This algorithm provides us with a large number of examples for trisection diagrams of closed oriented…

In this paper we construct a methodology for separating the divergencies due to different topological manifolds dual to Feynman graphs in colored group field theory. After having introduced the amplitude bounds using propagator cuts, we…

We study the class of simple graphs $\mathcal{G}^*$ for which every pair of distinct odd cycles intersect in at most one edge. We give a structural characterization of the graphs in $\mathcal{G}^*$ and prove that every $G \in \mathcal{G}^*$…

We show that the size of a 4-critical graph of girth at least five is bounded by a linear function of its genus. This strengthens the previous bound on the size of such graphs given by Thomassen. It also serves as the basic case for the…

Let $\mathcal{T}$ be the set of spanning trees of $G$ and let $L(T)$ be the number of leaves in a tree $T$. The leaf number $L(G)$ of $G$ is defined as $L(G)=\max\{L(T)|T\in \mathcal{T}\}$. Let $G$ be a connected graph of order $n$ and…

A tessellation of a graph is a partition of its vertices into vertex disjoint cliques. A tessellation cover of a graph is a set of tessellations that covers all of its edges. The $t$-tessellability problem aims to decide whether there is a…

Given a handle decomposition of a 4-manifold with boundary, and an open book decomposition of the boundary, we show how to produce a trisection diagram of a trisection of the 4-manifold inducing the given open book. We do this by making the…

Let $G$ be a simple topological graph and let $\Gamma$ be a polyline drawing of $G$. We say that $\Gamma$ \emph{partially preserves the topology} of $G$ if it has the same external boundary, the same rotation system, and the same set of…

A variety of powerful extremal results have been shown for the chromatic number of triangle-free graphs. Three noteworthy bounds are in terms of the number of vertices, edges, and maximum degree given by Poljak \& Tuza (1994), and…

We apply mapping class group techniques and trisections to study intersection forms of smooth 4-manifolds. Johnson defined a well-known homomorphism from the Torelli group of a compact surface. Morita later showed that every homology…

The problem of map enumeration concerns counting connected spatial graphs, with a specified number $j$ of vertices, that can be embedded in a compact surface of genus $g$ in such a way that its complement yields a cellular decomposition of…

Let $G$ be a graph. We use $P_t$ and $C_t$ to denote a path and a cycle on $t$ vertices, respectively. A {\em diamond} is a graph obtained from two triangles that share exactly one edge. A {\em kite} is a graph consists of a diamond and…

One of the earliest results in extremal graph theory, Mantel's theorem, states that the maximum number of edges in a triangle-free graph $G$ on $n$ vertices is $\lfloor n^2/4 \rfloor$. We investigate how this extremal bound is affected when…

Heegaard splittings stratify 3-manifolds by complexity; only $S^3$ admits a genus-zero splitting, and only $S^3$, $S^1 \times S^2$, and lens spaces $L(p,q)$ admit genus-one splittings. In dimension four, the second author and Jeffrey Meier…