Related papers: A Hilbert scheme of radius two
We study characteristics which might distinguish two-graphs by introducing different numerical measures on the collection of graphs on $n$ vertices. Two conjectures are stated, one using these numerical measures and the other using the deck…
A cyclic subgroup graph of a group $G$ is a graph whose vertices are cyclic subgroups of $G$ and two distinct vertices $H_1$ and $H_2$ are adjacent if $H_1\leq H_2$, and there is no subgroup $K$ such that $H_1<K<H_2$. M.T\u{a}rn\u{a}uceanu…
An arithmetical structure on a graph is given by a labeling of the vertices which satisfies certain divisibility properties. In this note, we look at several families of graphs and attempt to give counts on the number of arithmetical…
A 2-factor of a graph $G$ is a 2-regular spanning subgraph of $G$. We present a survey summarising results on the structure of 2-factors in regular graphs, as achieved by various researchers in recent years.
We give a bound on the spectral radius of subgraphs of regular graphs with given order and diameter. We give a lower bound on the smallest eigenvalue of a nonbipartite regular graph of given order and diameter.
Given an algebraic surface $X$, the Hilbert scheme $X^{[n]}$ of $n$-points on $X$ admits a contraction morphism to the $n$-fold symmetric product $X^{(n)}$ with the extremal ray generated by a class $\beta_n$ of a rational curve. We…
A digraph is 2-regular if every vertex has both indegree and outdegree two. We define an embedding of a 2-regular digraph to be a 2-cell embedding of the underlying graph in a closed surface with the added property that for every…
In this paper, we will investigate the jet schemes of determinantal varieties. It is quite often the case that the geometric information concerning the jet schemes of an algebraic variety can be described, but the more refined algebraic…
We give a notion of "combinatorial proximity" among strongly stable ideals in a given polynomial ring with a fixed Hilbert polynomial. We show that this notion guarantees "geometric proximity" of the corresponding points in the Hilbert…
A Graph is called 2-self-centered if its diameter and radius both equal to 2. In this paper, we begin characterizing these graphs by characterizing edge-maximal 2-self-centered graphs via their complements. Then we split characterizing…
Let $n\geq m$ be two positive integers, $S_{n,m}=K[x_1,\ldots,x_n,y_1,\ldots,y_m]$ and $I_{n,m}=(x_iy_j\;:\;1\leq i\leq n,1\leq j\leq m)\subset S_{n,m}$ the edge ideal of a complete bipartite graph. Denote…
Consider a component of the Hilbert scheme whose general point corresponds to a degree d genus g smooth irreducible and nondegenerate curve in a projective variety X. We give lower bounds for the dimension of such a component when X is P^3,…
Interval routing is a space efficient method to realize a distributed routing function. In this paper we show that every circular-arc graph allows a shortest path strict 2-interval routing scheme, i.e., by introducing a global order on the…
Graphs derived from groups are a widely studied class of graphs, motivated by their highly symmetric structure. In particular, G-graphs offer an easy and interesting alternative construction of semi-symmetric graphs. After recalling the…
We give a method of counting the number of curves with a given type of singularity in a suitably ample linear series on a smooth surface using punctual Hilbert schemes. The types of singulaties for which our methods suffice include the…
An incidence of a graph $G$ is a pair $(u,e)$ where $u$ is a vertex of $G$ and $e$ is an edge of $G$ incident with $u$. Two incidences $(u,e)$ and $(v,f)$ of $G$ are adjacent whenever (i) $u=v$, or (ii) $e=f$, or (iii) $uv=e$ or $uv=f$. An…
Hilbert schemes of suitable smooth, projective 3-fold scrolls over the Hirzebruch surface F_e, with e > 1, are studied. An irreducible component of the Hilbert scheme parametrizing such varieties is shown to be generically smooth of the…
We give an exponential lower bound for the Graver complexity of the incidence matrix of a complete bipartite graph of arbitrary size. Our result is a generalization of the result by Berstein and Onn (2009) for 3xr complete bipartite graphs,…
Orders on surfaces provide a rich source of examples of noncommutative surfaces. Other than some existence results, very little is known about the various moduli spaces that can be associated to them. Even fewer examples have been…
We investigate the geography of Hilbert schemes parametrizing closed subschemes of projective space with specified Hilbert polynomials. We classify Hilbert schemes with unique Borel-fixed points via combinatorial expressions for their…