Browse
A leaf of a tree is a vertex of degree one and a branch vertex of a tree is a vertex of degree at least three. In this paper, we show a degree condition for a claw-free graph to have spanning trees with at most five branch vertices and leaves in total. Moreover, the degree sum condition is best possible.
We prove that the number of unit distances among n planar points is at most 1.94 • n 4/3, improving on the previous best bound of 8 n 4/3. We also give better upper and lower bounds for several small values of n. We also prove some variants of the crossing lemma and improve some constant factors.
Two hexagons in the space are said to intersect heavily if their intersection consists of at least one common vertex as well as an interior point. We show that the number of hexagons on n points in 3-space without heavy intersections is o(n 2), under the assumption that the hexagons are ‘fat’.
Let X be a smooth projective K3 surface over the complex numbers and let C be an ample curve on X. In this paper we will study the semistability of the Lazarsfeld-Mukai bundle EC,A associated to a line bundle A on C such that |A| is a pencil on C and computes the Clifford index of C. We give a necessary and sufficient condition for EC,A to be semistable.
We prove criteria for a graph to be the Reeb graph of a function of a given class on a closed manifold: Morse–Bott, round, and in general smooth functions whose critical set consists of a finite number of submanifolds. The criteria are given in terms of whether the graph admits an orientation, which we call S-good orientation, with certain conditions on the degree of sources and sinks, similar to the known notion of good orientation in the context of Morse functions. We also study when such a function is the height function associated with an immersion of the manifold. The condition for a graph to admit an S-good orientation can be expressed in terms of the leaf blocks of the graph.
For each Montesinos knot K, we propose an efficient method to explicitly determine the irreducible SL(2, 
)-character variety, and show that it can be decomposed as χ0(K)⊔χ1(K)⊔χ2(K)⊔χ'(K), where χ0(K) consists of trace-free characters χ1(K) consists of characters of “unions” of representations of rational knots (or rational link, which appears at most once), χ2(K) is an algebraic curve, and χ'(K) consists of finitely many points when K satisfies a generic condition.
We offer new properties of the special Gini mean S(a, b) = aa /( a + b ) ⋅ bb /( a + b ), in connections with other special means of two arguments.
We treat a variation of graph domination which involves a partition (V 1, V 2,..., Vk ) of the vertex set of a graph G and domination of each partition class V i over distance d where all vertices and edges of G may be used in the domination process. Strict upper bounds and extremal graphs are presented; the results are collected in three handy tables. Further, we compare a high number of partition classes and the number of dominators needed.
Proctor and Scoppetta conjectured that
-
(1) there exists an infinite locally finite poset that satisfies their conditions VT and NTC but not SIS;
-
(2) there exists an infinite locally finite poset satisfying their conditions D3-C and D3MF but not both VT and FT; and
-
(3) there exists an infinite locally finite poset satisfying their conditions D3-C and D3MD but not NCC.
In this note, the conjecture of Proctor and Scoppetta, which is related to d-complete posets, is proven.
In this paper we introduce the concept of the Hamilton triangle of a given triangle in an isotropic plane and investigate a number of important properties of this concept. We prove that the Hamilton triangle is homological with the observed triangle and with its contact and complementary triangles. We also consider some interesting statements about the relationships between the Hamilton triangle and some other significant elements of the triangle, like e.g. the Euler and the Feuerbach line, the Steiner ellipse and the tangential triangle.
