Related papers: On Cobweb Posets and Discrete F-Boxes Tilings
A graph $G$ contains a graph $H$ as a pivot-minor if $H$ can be obtained from $G$ by applying a sequence of vertex deletions and edge pivots. Pivot-minors play an important role in the study of rank-width. Pivot-minors have mainly been…
Bir\'{o}, Hujter, and Tuza introduced the concept of $H$-graphs (1992), intersection graphs of connected subgraphs of a subdivision of a graph $H$. They naturally generalize many important classes of graphs, e.g., interval graphs and…
Let $\mathcal{F}$ be a family of graphs, and let $p,r$ be nonnegative integers. The \textsc{$(p,r,\mathcal{F})$-Covering} problem asks whether for a graph $G$ and an integer $k$, there exists a set $D$ of at most $k$ vertices in $G$ such…
This note argues that when dot-plotting distributions typically found in papers about web and social networks (degree distributions, component-size distributions, etc.), and more generally distributions that have high variability in their…
Daisies are a special type of hypergraphs introduced by Bollob\'{a}s, Leader and Malvenuto. An $r$-daisy determined by a pair of disjoint sets $K$ and $M$ is the $(r+|K|)$-uniform hypergraph $\{K\cup P:\: P\in M^{(r)}\}$. In [Combin.…
Over recent years there has been much interest in both Tur\'an and Ramsey properties of vertex ordered graphs. In this paper we initiate the study of embedding spanning structures into vertex ordered graphs. In particular, we introduce a…
We study Steiner Forest on $H$-subgraph-free graphs, that is, graphs that do not contain some fixed graph $H$ as a (not necessarily induced) subgraph. We are motivated by a recent framework that completely characterizes the complexity of…
We study the Zarankiewicz problem for $r$-partite, $r$-uniform intersection hypergraphs arising from $r$ families of axis-parallel boxes in $\mathbb{R}^d$ with prescribed directions $F_1, \dots, F_r \subseteq \{1, \dots, d\}$. This extends…
Submanifolds of Frobenius manifolds are studied. In particular, so-called natural submanifolds are defined and, for semi-simple Frobenius manifolds, classified. These carry the structure of a Frobenius algebra on each tangent space, but…
We "solve" the Freed-Witten anomaly equation, i.e., we find a geometrical classification of the B-field and A-field configurations in the presence of D-branes that are anomaly-free. The mathematical setting being provided by the geometry of…
We start with a Gromov-hyperbolic surface bundle $E$ over a graph, and drill out essential simple closed curves from fibers to obtain a drilled bundle $F$. We prove that for such drilled bundles $F$, the fundamental group $\pi_1(F)$ is…
Church-Ellenberg-Farb used the language of FI-modules to prove that the cohomology of certain sequences of hyperplane arrangements with S_n-actions satisfies representation stability. Here we lift their results to the level of the…
We introduce a multiscale topological description of the Megaparsec weblike cosmic matter distribution. Betti numbers and topological persistence offer a powerful means of describing the rich connectivity structure of the cosmic web and of…
Phylogenetic networks are a generalization of evolutionary or phylogenetic trees that are commonly used to represent the evolution of species which cross with one another. A special type of phylogenetic network is an {\em $X$-cactus}, which…
One introduces here the natural join $P \os Q$ of graded posets $< P,\leq_P >$ and $< Q,\leq_Q >$ with correspondingly maximal and minimal sets being identical as expressed by ordinal sum $P\oplus Q$ apart from other definition and due to…
The boxicity of a graph is the smallest dimension $d$ allowing a representation of it as the intersection graph of a set of $d$-dimensional axis-parallel boxes. We present a simple general approach to determining the boxicity of a graph…
The aim of this work is to investigate the F-index and F-coindex of the line graphs of the cycle graphs, star graphs, tadpole graphs, wheel graphs and ladder graphs using the subdivision concepts. F-index of the line graph of subdivision…
Several recent papers have explored families of rational polyhedra whose integer points are in bijection with certain families of numerical semigroups. One such family, first introduced by Kunz, has integer points in bijection with…
A linear arrangement is a labeling or a numbering or a linear ordering of the vertices of a graph. In this paper we solve the minimum linear arrangement problem for bijective connection graphs (for short BC graphs) which include hypercubes,…
An important classification problem in Algebraic Geometry deals with pairs $(\E,\phi)$, consisting of a torsion free sheaf $\E$ and a non-trivial homomorphism $\phi\colon (\E^{\otimes a})^{\oplus b}\lra\det(\E)^{\otimes c}\otimes \L$ on a…