Related papers: Dynkin Graphs, Gabri\'{e}lov Graphs and Triangle S…

By examining the 3 surface angles which exist at any of the 8 vertices of a Diophantine parallelepiped, and classifying them by the appearance of a right angle, it is discovered that 5 unique classes of Diophantine parallelepipeds exist. It…

Turan's Theorem states that every graph of a certain edge density contains a complete graph $K^k$ and describes the unique extremal graphs. We give a similar Theorem for l-partite graphs. For large l, we find the minimal edge density…

We characterize those closed $2k$-manifolds admitting smooth maps into $(k+1)$-manifolds with only finitely many critical points, for $k\in\{2,4\}$. We compute then the minimal number of critical points of such smooth maps for $k=2$ and,…

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…

We wish to draw attention to an interesting and promising interaction of two theories. On the one hand, it is the theory of \textbf{pseudo-triangulations} which was useful for implicit solution of thecarpenter's rule problem and proved…

We compare Stein fillings and Milnor fibers for rational surface singularities with reduced fundamental cycle. Deformation theory for this class of singularities was studied by de Jong-van Straten in [dJvS98]; they associated a germ of a…

In the course of proving the strong perfect graph theorem, Chudnovsky, Robertson, Seymour, and Thomas showed that every perfect graph either belongs to one of five basic classes or admits one of several decompositions. Four of the basic…

In this paper we determine a complete list of rational surface singularities which have metrically conical bilipschitz type of its inner metric. We achieve this by using the thick-thin decomposition of Birbrair, Neumann and Pichon.

In this note we show that the singular probability of the adjacency matrix of a random $d$-regular graph on $n$ vertices, where $d$ is fixed and $n \to \infty$, is bounded by $n^{-1/3+o(1)}$. This improves a recent bound by Huang. Our…

We introduce a new model of indeterminacy in graphs: instead of specifying all the edges of the graph, the input contains all triples of vertices that form a connected subgraph. In general, different (labelled) graphs may have the same set…

I give various criteria for singularities to appear on geometric generic fibers of morphism between smooth schemes in positive characteristics. This involves local fundamental groups, jacobian ideals, projective dimension, tangent and…

All varieties, extremal contractions, singularities are divided on exceptional and non-exceptional ones. Roughly speaking, there are the infinite families of non-exceptional varieties, extremal contractions or singularities and only the…

In this article we generalize a theorem of Benson for generalized quadrangles to strongly regular graphs and directed strongly regular graphs. The main result provides numerical restrictions on the number of fixed vertices and the number of…

We generalize the notions of singularities and ordinary points from linear ordinary differential equations to D-finite systems. Ordinary points of a D-finite system are characterized in terms of its formal power series solutions. We also…

A graph may be the Kronecker cover in more than one way. In this note we explore this phenomenon. Using this approach we show that the least common cover of two graphs need not be unique.

We consider large uniform labeled random graphs in different classes with few induced $P_4$ ($P_4$ is the graph consisting of a single line of $4$ vertices) which generalize the case of cographs. Our main result is the convergence to a…

Fibered multilinks are a generalization of classical fibered knots and open books that arise in the study of surface singularities and Milnor fibrations. We prove that if the canonical contact structure on the link of a surface singularity…

In the standard Category of Graphs, the graphs allow only one edge to be incident to any two vertices, not necessarily distinct, and the graph morphisms must map edges to edges and vertices to vertices while preserving incidence. We refer…

A $d$-regular graph on $n$ nodes has at most $T_{\max} = \frac{n}{3} \tbinom{d}{2}$ triangles. We compute the leading asymptotics of the probability that a large random $d$-regular graph has at least $c \cdot T_{\max}$ triangles, and…

We completely classify all plane curves of degree at most 30 with a unique cuspidal (locally unibranch) singular point and rational normalization in terms of the Newton pairs parameterizing the cusp. We distinguish between prime and…