Related papers: Dual graphs of exceptional divisors
A formula for computing the metric dimension of a simple graph, having no singleton twin, is given. A sufficient condition for a simple graph to have the exchange property, for resolving sets, is found. Some families of power graphs of…
We consider a classical N. Steenrod's problem on realization of homology classes by images of the fundamental classes of manifolds. It is well-known that each integral homology class can be realized with some multiplicity as an image of the…
A split of a polytope $P$ is a (regular) subdivision with exactly two maximal cells. It turns out that each weight function on the vertices of $P$ admits a unique decomposition as a linear combination of weight functions corresponding to…
We provide lower bounds on the connectivity of the independence complexes of hypergraphs. Additionally, we compute the homotopy types of the independence complexes of $d$-uniform properly-connected triangulated hypergraphs.
The clique complex of a graph G is a simplicial complex whose simplices are all the cliques of G, and the line graph L(G) of G is a graph whose vertices are the edges of G and the edges of L(G) are incident edges of G. In this article, we…
Understanding the structure of a graph along with the structure of its subgraphs is important for several problems in graph theory. Two examples are the Reconstruction Conjecture and isomorph-free generation. This paper raises the question…
Let $\mathcal{A} $ be a complexified-real arrangement of lines in $\mathbb{C}^2.$ Let $H$ be any line in $ \mathcal{A} $. Then, form a new complexified-real arrangement $ \mathcal{B}_H = \mathcal{A} \cup \mathcal{C} $ where $ \mathcal{C}…
Using a ribbon structure of the graph, we construct a dissection of the symmetric edge polytope of a graph into unimodular simplices. Our dissection is shellable, and one can interpret the elements of the resulting $h$-vector via graph…
Over the complex numbers, the complement of a collection of hyperplanes is a widely-studied object; the cohomology ring, in particular, is known to have a structure depending only on the combinatorial properties of the intersection of…
We study set systems formed by neighborhoods in graphs of bounded twin-width. We start by proving that such graphs have linear neighborhood complexity, in analogy to previous results concerning graphs from classes with bounded expansion and…
A graph $G$ is said to be perfectly divisible if for every induced subgraph $H$ of $G$ with at least one edge, the vertex set $V(H)$ can be partitioned into two sets $A, B$ such that $H[A]$ is perfect and $\omega(B) < \omega(H)$. It is easy…
In this paper, we will show dichotomy theorems for the computation of polynomials corresponding to evaluation of graph homomorphisms in Valiant's model. We are given a fixed graph $H$ and want to find all graphs, from some graph class,…
We introduce a new type of examples of bounded degree acyclic Borel graphs and study their combinatorial properties in the context of descriptive combinatorics, using a generalization of the determinacy method of Marks. The motivation for…
Consider a projective variety $X \subset \mathbb{P}^n$ (over an algebraically closed field of characteristic zero), together with a (reduced) simple normal crossings divisor $E \subset \mathbb{P}^n$, where the degrees of both $X$ and $E$…
Let G=(V,E) be a graph. A vertex dominates itself and all its neighbors, i.e., every vertex v in V dominates its closed neighborhood N[v]. A vertex set D in G is an efficient dominating (e.d.) set for G if for every vertex v in V, there is…
Inspired by notorious combinatorial optimization problems on graphs, in this paper we consider a series of related problems defined using a metric space and topology determined by a graph. Particularly, we present the Independent Set,…
The \emph{difference subgroup graph} $D(G)$ of a finite group $G$ is defined as the graph whose vertices are the non-trivial proper subgroups of $G$, with two distinct vertices $H$ and $K$ adjacent if and only if $\langle H, K \rangle = G$…
Normal maps between discrete groups $N\rightarrow G$ were characterized [FS] as those which induce a compatible topological group structure on the homotopy quotient $EN\times_N G$. Here we deal with topological group (or loop) maps…
Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…
We supply an upper bound on the distinguishing chromatic number of certain infinite graphs satisfying an adjacency property. Distinguishing proper $n$-colourings are generalized to the new notion of distinguishing homomorphisms. We prove…