Related papers: Constructing entire minimal graphs by evolving pla…

Consider a graph with n nodes and m edges, independent edge weights and lengths, and arbitrary distance demands for node pairs. The spanner problem asks for a minimum-weight subgraph that satisfies these demands via sufficiently short paths…

The well-known 1-2-3 Conjecture asserts that the edges of every graph without an isolated edge can be weighted with $1$, $2$ and $3$ so that adjacent vertices receive distinct weighted degrees. This is open in general. We prove that every…

In this paper we study surfaces in Euclidean 3-space that satisfy a Weingarten condition of linear type as $\kappa_1=m \kappa_2 +n$, where $m$ and $n$ are real numbers and $\kappa_1$ and $\kappa_2$ denote the principal curvatures at each…

For each odd integer $k\ge 5$, we prove that, if $M$ is a simple rank-$r$ binary matroid with no odd circuit of length less than $k$ and with $|M| > k 2^{r-k+1}$, then $M$ is isomorphic to a restriction of the rank-$r$ binary affine…

The study of (minimally) rigid graphs is motivated by numerous applications, mostly in robotics and bioinformatics. A major open problem concerns the number of embeddings of such graphs, up to rigid motions, in Euclidean space. We capture…

Let $ \Omega \subsetneq \mathbf{R}^n\,(n\geq 2)$ be an unbounded convex domain. We study the minimal surface equation in $\Omega$ with boundary value given by the sum of a linear function and a bounded uniformly continuous function in $…

This is the second paper in a series of three papers. In the first paper of the series, "Artinian Gorenstein algebras with linear resolutions", (arXiv:1306.2523, J. of Algebra, to appear) we prove that it is possible to give the minimal…

We introduce and study the problem of constructing geometric graphs that have few vertices and edges and that are universal for planar graphs or for some sub-class of planar graphs; a geometric graph is \emph{universal} for a class…

An octilinear drawing of a planar graph is one in which each edge is drawn as a sequence of horizontal, vertical and diagonal at 45 degrees line-segments. For such drawings to be readable, special care is needed in order to keep the number…

We refine Osserman's argument on the exceptional values of the Gauss map of algebraic minimal surfaces. This gives an effective estimate for the number of exceptional values and the totally ramified value number for a wider class of…

This MSci thesis surveys results in extremal graph theory, in particular relating to Hamilton cycles. Szem\'eredi's Regularity Lemma plays a central role. We also investigate the robust outexpansion property for digraphs. Kelly showed that…

It is shown that a simple graph which is embeddable in the real projective plane is minimally 3-rigid if and only if it is (3,6)-tight. Moreover the topologically uncontractible embedded graphs of this type are constructible from one of 8…

For a graph $G$, let $f_2(G)$ denote the largest number of vertices in a $2$-regular subgraph of $G$. We determine the minimum of $f_2(G)$ over $3$-regular $n$-vertex simple graphs $G$. To do this, we prove that every $3$-regular multigraph…

Let $f(n,k)$ be the minimum number of edges that must be removed from some complete geometric graph $G$ on $n$ points, so that there exists a tree on $k$ vertices that is no longer a planar subgraph of $G$. In this paper we show that…

We study $c$-crossing-critical graphs, which are the minimal graphs that require at least $c$ edge-crossings when drawn in the plane. For $c=1$ there are only two such graphs without degree-2 vertices, $K_5$ and $K_{3,3}$, but for any fixed…

We give the first construction of explicit constant-degree lossless vertex expanders. Specifically, for any $\varepsilon > 0$ and sufficiently large $d$, we give an explicit construction of an infinite family of $d$-regular graphs where…

Consider the Grassmann graph of $k$-dimensional subspaces of an $n$-dimensional vector space over the $q$-element field, $1<k<n-1$. Every automorphism of this graph is induced by a semilinear automorphism of the corresponding vector space…

We study minimal graphs in the homogeneous Riemannian 3-manifold $\widetilde{PSL_2(\mathbb{R})}$ and we give examples of invariant surfaces. We derive a gradient estimate for solutions of the minimal surface equation in this space and…

This survey paper deals with upper and lower bounds on the number of $k$-matchings in regular graphs on $N$ vertices. For the upper bounds we recall the upper matching conjecture which is known to hold for perfect matchings. For the lower…

Let $\mathcal{P}$ be a set of $n=2m+1$ points in the plane in general position. We define the graph $GM_\mathcal{P}$ whose vertex set is the set of all plane matchings on $\mathcal{P}$ with exactly $m$ edges. Two vertices in…