Related papers: Minimal even sets of nodes

We prove that every minimal brick on n vertices has at least n/9 vertices of degree at most 4.

The minimum status of a graph is the minimum of statuses of all vertices of this graph. We give a sharp upper bound for the minimum status of a connected graph with fixed order and matching number (domination number, respectively), and…

Given a finite point set $X$ in the plane, the degree of a pair $\{x,y\} \subset X$ is the number of empty triangles $t=conv\{x,y,z\}$, where empty means $t\cap X=\{x,y,z\}$. Define $deg X$ as the maximal degree of a pair in $X$. Our main…

Let M be a 3-manifold (possibly with boundary). We show that, for any positive integer g, there exists an open nonempty set of metrics on M for each of which there are stable compact embedded minimal surfaces of genus g with arbitrarily…

For the minimal graph with strict convex level sets, we find an auxiliary function to study the Gaussian curvature of the level sets. We prove that this curvature function is a concave function with respect to the height of the minimal…

Bounds on the minimum degree and on the number of vertices at- taining it have been much studied for finite edge-/vertex-minimally k- connected/k-edge-connected graphs. We give an overview of the results known for finite graphs, and show…

We find a surface of degree 7 in real projective three-space P^3(R) with 99 real nodes within a family of surfaces with dihedral symmetry: First, we consider this family over some small prime fields, which allows us to test all possible…

Let $G$ be a simple graph. Consider all weightings of the vertices of $G$ with real numbers whose total sum is nonnegative. How many edges of $G$ have endpoints with a nonnegative sum? We consider the minimum number of such edges over all…

Let G be a simple graph without isolated vertices. For a vertex i in G, the degree d_i is the number of vertices adjacent to i and the average 2-degree m_i is the mean of the degrees of the vertices which are adjacent to i. The sequence of…

Considering regular graphs with every edge in a triangle we prove lower bounds for the number of triangles in such graphs. For r-regular graphs with r <= 5 we exhibit families of graphs with exactly that number of triangles and then…

Many classical results in algebraic geometry arise from investigating some extremal behaviors that appear among projective varieties not lying on any hypersurface of fixed degree. We study two numerical invariants attached to such…

In this note, we use elementary submodels to prove that a separable monotonically normal compactum can be mapped on a separable metric space via a continuous function whose fibers have cardinality at most 2.

Let $S$ be a minimal surface of general type with $p_g=0$ and $K^2=6$, such that its bicanonical map $\fie\colon S\to\pp^6$ is not birational. The map $\fie$ is a morphism of degree $\le 4$ onto a surface. The case of $\deg\fie=4$ is…

Minimal prime graphs are connected graphs on at least two vertices whose complements satisfy the following conditions: triangle-freeness, 3-colorability, and edge-maximality with respect to the latter two properties. These graphs are prime…

Consider a surface $S$ and let $M\subset S$. If $S\setminus M$ is not connected, then we say $M$ \emph{separates} $S$, and we refer to $M$ as a \emph{separating set} of $S$. If $M$ separates $S$, and no proper subset of $M$ separates $S$,…

A non-classical Godeaux surface is a minimal surface of general type with $\chi=K^2=1$ but with $h^{01}\neq0$. We prove that such surfaces fulfill $h^{01}=1$ and they can exist only over fields of positive characteristic at most 5. Like…

We introduce a concept of minimality for Fano polygons. We show that, up to mutation, there are only finitely many Fano polygons with given singularity content, and give an algorithm to determine the mutation-equivalence classes of such…

We give simple criteria for the singularities appearing on surfaces codimension less than or equal to two. As applications, we give conditions for codimension two singularities that appear in ruled surfaces and center maps of surfaces in…

The minimum rank of a simple graph $G$ is defined to be the smallest possible rank over all symmetric real matrices whose $ij$th entry (for $i\neq j$) is nonzero whenever $\{i,j\}$ is an edge in $G$ and is zero otherwise. Minimum rank is a…

It is well-known that 1-planar graphs have minimum degree at most 7, and not hard to see that some 1-planar graphs have minimum degree exactly 7. In this note we show that any such 1-planar graph has at least 24 vertices, and this is tight.