Related papers: Classification and Construction of Planar, 3-Conne…
In this thesis, we study the structure of the polyhedral product $\mathcal{Z}_{\mathcal{K}}(D^1,S^0)$ determined by an abstract simplicial complex ${\mathcal{K}}$ and the pair $(D^1,S^0)$. We showed that there is natural embedding of the…
We determine the number of labelled chordal planar graphs with $n$ vertices, which is asymptotically $c_1\cdot n^{-5/2} \gamma^n n!$ for a constant $c_1>0$ and $\gamma \approx 11.89235$. We also determine the number of rooted simple chordal…
A graph class $\mathcal{G}$ admits product structure if there exists a constant $k$ such that every $G \in \mathcal{G}$ is a subgraph of $H \boxtimes P$ for a path $P$ and some graph $H$ of treewidth $k$. Famously, the class of planar…
We use a representation of a graded twisted tensor product of $K[x]$ with $K[y]$ in $L(K^{\Bbb{N}_0})$ in order to obtain a nearly complete classification of these graded twisted tensor products via infinite matrices. There is one…
We show that the graph of a simplicial polytope of dimension $d \ge 3$ has no nontrivial minimum edge cut with fewer than $d(d+1)/2$ edges, hence the graph is $\min\{\delta, d(d+1)/2\}$-edge-connected where $\delta$ denotes the minimum…
In this paper we compute the homotopy groups of the symplectomorphism groups of the 3-, 4- and 5-point blow-ups of the projective plane (considered as monotone symplectic Del Pezzo surfaces). Along the way, we need to compute the homotopy…
This work is divided into two main parts. The first part is devoted to exploring the connectivity of random subgraphs of cartesian products of $K_1$, $K_2$, and $P_3$. In the second part, the author presents a short review of the results…
We present how to construct elliptically fibered K3 surfaces via Weierstrass models which can be parametrized in terms of Wilson lines in the dual heterotic string theory. We work with a subset of reflexive polyhedras that admit two fibers…
In 1956, Tutte proved the celebrated theorem that every 4-connected planar graph is hamiltonian. This result implies that every more than $\frac{3}{2}$-tough planar graph on at least three vertices is hamiltonian and so has a 2-factor.…
We introduce a deformed product construction for simple polytopes in terms of lower-triangular block matrix representations. We further show how Gale duality can be employed for the construction and for the analysis of deformed products…
The existence of Hamiltonian cycles in 1-planar graphs with higher connectivity has attracted considerable attention. Recently, the authors and Dong proved that 4-connected 1-planar chordal graphs are Hamiltonian-connected. In this paper,…
Strictly-convex straight-line drawings of $3$-connected planar graphs in small area form a classical research topic in Graph Drawing. Currently, the best-known area bound for such drawings is $O(n^2) \times O(n^2)$, as shown by…
A non-planar graph is almost-planar if either deleting or contracting any edge makes it planar. A graph with $n$ vertices is pancyclic if it contains a cycle of every length from $3$ to $n$, and it is Hamiltonian if it contains a cycle of…
We study the multiplicative structure of orbifold Hochschild cohomology in an attempt to generalize the results of Kontsevich and Calaque-Van den Bergh relating the Hochschild and polyvector field cohomology rings of a smooth variety. We…
We develop a space-level refinement of the $2$-factor homology by constructing a stable homotopy type associated to a certain family $\mathscr{G}$ of planar trivalent graphs equipped with perfect matchings. Specifically, we define a cover…
A graph is called strongly $\Z_{2k+1}$-connected if for each boundary function $\beta: V(G)\mapsto \Z_{2k+1}$ with $\sum_{v\in V(G)}\beta(v)\equiv 0\pmod{2k+1}$, there exists an orientation $D$ of $G$ such that $d_D^+(v) - d_D^-(v) \equiv…
Given a hypergraph $H$, the Planar Support problem asks whether there is a planar graph $G$ on the same vertex set as $H$ such that each hyperedge induces a connected subgraph of $G$. Planar Support is motivated by applications in graph…
We study the recognition complexity of subgraphs of k-connected planar cubic graphs for k = 1, 2, 3. We present polynomial-time algorithms to recognize subgraphs of 1- and 2-connected planar cubic graphs, both in the variable and fixed…
We use the lens of Zappa--Sz\'ep decomposition to examine the relationship between directed graph products and $k$-graph products. There are many examples of higher-rank graphs, or $k$-graphs, whose underlying directed graph may be factored…
We classify the connected-homogeneous digraphs with more than one end. We further show that if their underlying undirected graph is not connected-homogeneous, they are highly-arc-transitive.