Related papers: On 2-complexes embeddable in 4-space, and the excl…

Discovering the underlying structures present in large real world graphs is a fundamental scientific problem. In this paper we show that a graph's clique tree can be used to extract a hyperedge replacement grammar. If we store an ordering…

This article focuses on a class of properly edge-colored graphs, which arise from topological combinatorics, and investigates their embeddings onto surfaces. Specifically, these graphs are known as the dual graphs of balanced normal…

It is proved that any smooth manifold $\mathcal M$ of dimension $m$ admits a smooth polynomially convex embedding into $\mathbb C^n$ when $n\geq \lfloor 5m/4\rfloor$. Further, such embeddings are dense in the space of smooth maps from…

The class of all even-hole-free graphs has unbounded tree-width, as it contains all complete graphs. Recently, a class of (even-hole, $K_4$)-free graphs was constructed, that still has unbounded tree-width [Sintiari and Trotignon, 2019].…

Given two graphs $G$ and $H$, we say that $G$ contains $H$ as an induced minor if a graph isomorphic to $H$ can be obtained from $G$ by a sequence of vertex deletions and edge contractions. We study the complexity of Graph Isomorphism on…

An alternative foundation for 2-categories is explored by studying graph-theoretically a partial operation on 2-cells named juncture, which can replace vertical and horizontal composition. Juncture is a generalized vertical composition of…

We approach the cycle double cover conjecture by looking for a circular 2-cell embedding of cubic graphs on an arbitrary surface. It is easy to see that if such an embedding exists, we can get to it from an arbitrary starting 2-cell…

In recent years, there has been significant interest in characterizing the induced subgraph obstructions to bounded treewidth and pathwidth. While this has recently been resolved for pathwidth, the case of treewidth remains open, and prior…

We prove that 2-dimensional simplicial complexes whose first homology group is trivial have topological embeddings in 3-space if and only if there are embeddings of their link graphs in the plane that are compatible at the edges and they…

We give a structural description of the class $\cal C$ of graphs that do not contain a cycle with a unique chord as an induced subgraph. Our main theorem states that any connected graph in $\cal C$ is either in some simple basic class or…

This paper introduces the notion of involution module, the first generalization of the modular decomposition of 2-structure which has a unique linear-sized decomposition tree. We derive an O(n^2) decomposition algorithm and we take…

We prove that any \(2\)-connected graph \(G\) on \(n\) vertices with minimum degree \(\delta(G) \ge \frac{n}{4}+2\) contains a \(2\)-connected subgraph of order \(k\) for every integer \(k\) with \(4 \le k \le n\). This improves a previous…

This thesis addresses the question of the maximal number of $d$-simplices for a simplicial complex which is embeddable into $\mathbb{R}^r$ for some $d \leq r \leq 2d$. A lower bound of $f_d(C_{r + 1}(n)) =…

We calculate the Seiberg-Witten invariants of branched covers of prime degree, where the branch locus consists of embedded spheres. Aside from the formula itself, our calculations give rise to some new constraints on configurations of…

Recently, neural network architectures have been developed to accommodate when the data has the structure of a graph or, more generally, a hypergraph. While useful, graph structures can be potentially limiting. Hypergraph structures in…

There are 13 equivalence classes of 2D second order quantum and classical superintegrable systems with nontrivial potential, each associated with a quadratic algebra of hidden symmetries. We study the finite and infinite irreducible…

We show that the 14 graphs obtained by $\nabla\mathrm{Y}$ moves on K_7 constitute a complete list of the minor minimal intrinsically knotted graphs on 21 edges. We also present evidence in support of a conjecture that the 20 graph Heawood…

We study a natural model of random 2-dimensional cubical complex which is a subcomplex of an n-dimensional cube, and where every possible square $2$-face is included independently with probability p. Our main result is to exhibit a sharp…

We study the \emph{picture space} $X^d(G)$ of all embeddings of a finite graph $G$ as point-and-line arrangements in an arbitrary-dimensional projective space, continuing previous work on the planar case. The picture space admits a natural…

We determine all factorisations $X=AB$, where $X$ is a finite almost simple group and $A,B$ are core-free subgroups such that $A\cap B$ is cyclic or dihedral. As a main application, we classify the graphs $\Gamma$ admitting an almost simple…