Related papers: Topological and Algebraic Characterizations of Gal…

We prove an enumerative formula for the algebraic Euler characteristic of Brill-Noether varieties, parametrizing degree d and rank r linear series on a general genus g curve, with ramification profiles specified at up to two general points.…

Let $p$ be a prime number. Every two-variable polynomial $f(x_1, x_2)$ over a finite field of characteristic $p$ defines an Artin--Schreier--Witt tower of surfaces whose Galois group is isomorphic to $\mathbb Z_p$. Our goal of this paper is…

Given a finite group $G$, the generating graph $\Gamma(G)$ of $G$ has as vertices the non-identity elements of $G$ and two vertices are adjacent if and only if they are distinct and generate $G$ as group elements. Let $G$ be a 2-generated…

Let $ \Phi=(G, \varphi) $ be a connected complex unit gain graph ($ \mathbb{T} $-gain graph) on a simple graph $ G $ with $ n $ vertices and maximum vertex degree $ \Delta $. The associated adjacency matrix and degree matrix are denoted by…

We present a way of topologizing sets of Galois types over structures in abstract elementary classes with amalgamation. In the elementary case, the topologies thus produced refine the syntactic topologies familiar from first order logic. We…

A graph $\Gamma$ is $G$-symmetric if it admits $G$ as a group of automorphisms acting transitively on the set of arcs of $\Gamma$, where an arc is an ordered pair of adjacent vertices. Let $\Gamma$ be a $G$-symmetric graph such that its…

The prime graph of a finite group $G$, which is denoted by ${\rm GK}(G)$, is a simple graph whose vertex set is comprised of the prime divisors of $|G|$ and two distinct prime divisors $p$ and $q$ are joined by an edge if and only if there…

The classical Andr\'{a}sfai--Erd\H{o}s--S\'{o}s Theorem states that for $\ell\ge 2$, every $n$-vertex $K_{\ell+1}$-free graph with minimum degree greater than $\frac{3\ell-4}{3\ell-1}n$ must be $\ell$-partite. We establish a simple…

We investigate the topological structures of Galois covers of surfaces of minimal degree (i.e., degree n) in n+1 dimensional complex projective space. We prove that for n is greater than or equal to 5, the Galois covers of any surfaces of…

For a graph $G$, the central graph $C(G)$ is the graph constructed from $G$ by subdividing each edge of $G$ with one vertex and also by adding an edge to every pair of non-adjacent vertices in $G$. Also for a graph $G$, let $\gamma(G)$ and…

A quick proof of Gallai's celebrated theorem on color-critical graphs is given from Gallai's simple, ingenious lemma on factor-critical graphs, in terms of partitioning the vertex-set into a minimum number of hyperedges of a hereditary…

We classify $n$-dimensional geometric graph manifolds with nonnegative scalar curvature, and first show that if $n>3$, the universal cover splits off a codimension 3 Euclidean factor. We then proceed with the classification of the…

Each rule $f$ that assigns a vector $f(G)$ to an $(n+1)$-graph $G$ determines a class (or property) of $n$-manifold invariants. An invariant $v=v(M)$ is in this class if, for any triangulated manifold $|G|=M$, one has that $v(M)$ is a…

A well known Euler's formula consequence's corollary in graph theory states that: For a connected simple planar graph with $n$ vertices and $m$ edges, and girth $g$, we have $m \leq \frac{g}{g-2}(n-2)$. We show that a connected simple plane…

The prime graph $\Gamma(G)$ of a finite group $G$ (also known as the Gruenberg-Kegel graph) has as its vertices the prime divisors of $|G|$, and $p\text-q$ is an edge in $\Gamma(G)$ if and only if $G$ has an element of order $pq$. Since…

Consider a singular holomorphic map-germ $f: (X,\underline{0}) \to (\mathbb C,0)$ where $X$ is a singular complex analytic variety in $\mathbb C^N$, and another holomorphic map-germ $g: (X,\underline{0}) \to (\mathbb C,0)$ which is…

In this paper, we introduce the concept of $k$-integral graphs. A graph $\Gamma$ is called $k$-integral if the extension degree of the splitting field of the characteristic polynomial of $\Gamma$ over rational field $\mathbb Q$ is equal to…

The aim of this paper is to derive on the basis of the Euler's formula several analytical relations which hold for certain classes of planar graphs and which can be useful in algorithmic graph theory.

The independence complex of a graph $G=(V,E)$ is the simplicial complex $I(G)$ on vertex set $V$ whose simplices are the independent sets in $G$. We present new lower bounds on the eigenvalues of the $k$-dimensional Laplacian $L_k(I(G))$ in…

Let $G$ be an abelian group. The main theorem of this paper asserts that there exists a Cayley graph on $G$ with chromatic number $3$ if and only if $G$ is not of exponent $1$, $2$, or $4$. For connected Cayley graphs, we also show that…