Related papers: A Hilbert scheme of radius two

A mixed graph is a graph with undirected and directed edges. Guo and Mohar in 2017 determined all mixed graphs whose Hermitian spectral radii are less than $2$. In this paper, we give a sufficient condition which can make Hermitian spectral…

We present a number of relations involving the number of cliques in a graph and its spectral radius.

A general scheme for determining and studying integrable deformations of algebraic curves is presented. The method is illustrated with the analysis of the hyperelliptic case. An associated multi-Hamiltonian hierarchy of systems of…

We classify minimal-degree curves in the Hilbert schemes of points on algebraic surfaces. When the algebraic surface is the projective plane, the nef cone and a flip structure of these Hilbert schemes are determined.

We discuss two conjectures by Francesco Severi and Joe Harris about the irreducibility and the dimension of the Hilbert scheme parameterizing smooth projective curves of given degree and genus.

Previously, Biggs has conjectured that the resistance between any two points on a distance-regular graph of valency greater than 2 is bounded by twice the resistance between adjacent points. We prove this conjecture, give the sharp constant…

Consider a variant of the graph diameter of a polyhedron where each step in a walk between two vertices travels maximally in a circuit direction instead of along incident edges. Here circuit directions are non-trivial solutions to…

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…

We calculate the Picard group, over the integers, of the Hilbert scheme of smooth, irreducible, non-degenerate curves of degree $d$and genus $g \geq 4$ in ${\Bbb P}^r$, in the case when $d \geq 2g+1 $ and $r \leq d-g$. We express the…

Various algebraic structures have recently appeared in a parallel way in the framework of Hilbert schemes of points on a surface and respectively in the framework of equivariant K-theory [N1,Gr,S2,W], but direct connections are yet to be…

We investigate the appearance of the square of a Hamilton cycle in the model of randomly perturbed graphs, which is, for a given $\alpha \in (0,1)$, the union of any $n$-vertex graph with minimum degree $\alpha n$ and the binomial random…

Let $G=(V,E)$ be a graph. A set of vertices $A$ is an incidence generator for $G$ if for any two distinct edges $e,f\in E(G)$ there exists a vertex from $A$ which is an endpoint of either $e$ or $f$. The smallest cardinality of an incidence…

The 2-blowup of a graph is obtained by replacing each vertex with two non-adjacent copies; a graph is biplanar if it is the union of two planar graphs. We disprove a conjecture of Gethner that 2-blowups of planar graphs are biplanar:…

In this paper we present a characterisation, by an infinite family of minimal forbidden induced subgraphs, of proper circular arc graphs which are intersection graphs of paths on a grid, where each path has at most one bend (turn).

We discuss the parabolic Hilbert scheme of points on smooth surface, which is an interesting generalization of Hilbert scheme of points on surface. Some of the studies by Ellingsrud-Stromme, Goettsche, Cheah, Nakajima and Grojnowski can be…

A set of vertices in a graph is agile if, however we partition the set into two parts, we can always find two vertex-disjoint connected subgraphs where one covers the first and the other the second part. We present a characterization for…

We prove that the Hilbert scheme of 11 points on a smooth threefold is irreducible. In the course of the proof, we present several known and new techniques for producing curves on the Hilbert scheme.

This paper gives a fairly explicit formula for the Hilbert series of algebras of Veronese type.

Let $H$ be a fixed undirected graph on $k$ vertices. The $H$-hitting set problem asks for deleting a minimum number of vertices from a given graph $G$ in such a way that the resulting graph has no copies of $H$ as a subgraph. This problem…

We study families of rational curves on an algebraic variety satisfying incidence conditions. We prove an analogue of bend-and-break: that is, we show that under suitable conditions, such a family must contain reducibles. In the case of…