Computing Severi degrees with long-edge graphs
نویسندگان
چکیده
منابع مشابه
q-Floor Diagrams computing Refined Severi Degrees for Plane Curves
The Severi degree is the degree of the Severi variety parametrizing plane curves of degree d with δ nodes. Recently, Göttsche and Shende gave two refinements of Severi degrees, polynomials in a variable q, which are conjecturally equal, for large d. At q = 1, one of the refinements, the relative Severi degree, specializes to the (non-relative) Severi degree. We give a combinatorial description ...
متن کاملCycles and paths in edge-colored graphs with given degrees
Sufficient degree conditions for the existence of properly edge-colored cycles and paths in edge-colored graphs, multigraphs and random graphs are inverstigated. In particular, we prove that an edgecolored multigraph of order n on at least three colors and with minimum colored degree greater than or equal to d 2 e has properly edge-colored cycles of all possible lengths, including hamiltonian c...
متن کاملEdge coloring of graphs with small average degrees
Let G be a simple graph with average degree . d and maximum degree . It is proved, in this paper that G is not critical if . d6 6 and ¿ 8, or . d6 20 3 and ¿ 9. This result generalizes earlier results of Vizing (Metody Diskret. Analiz. 5 (1965) 9), Mel’nikov (Mat. Zametki 7 (1970) 671) and Hind and Zhao (Discrete Math. 190 (1998) 107) and Yan and Zhao (Graphs Combin. 16 (2) (2000) 245). It also...
متن کاملA combinatorial analysis of Severi degrees
Based on results by Brugallé and Mikhalkin, Fomin and Mikhalkin give formulas for computing classical Severi degreesN using long-edge graphs. In 2012, Block, Colley and Kennedy considered the logarithmic version of a special function associated to long-edge graphs which appeared in Fomin-Mikhalkin’s formula, and conjectured it to be linear. They have since proved their conjecture. At the same t...
متن کاملComputing rupture degrees of some graphs
Computer or communication networks are so designed that they do not easily get disrupted under external attack and, moreover, these are easily reconstructed when they do get disrupted. These desirable properties of networks can be measured by various parameters such as connectivity, toughness, tenacity and rupture degree. Among these parameters, rupture degree is comparatively better parameter ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Brazilian Mathematical Society, New Series
سال: 2014
ISSN: 1678-7544,1678-7714
DOI: 10.1007/s00574-014-0066-6