✦ LIBER ✦

Refined Bounds on the Number of Connected Components of Sign Conditions on a Variety

✍ Scribed by Sal Barone; Saugata Basu

Publisher: Springer
Year: 2011
Tongue: English
Weight: 693 KB
Volume: 47
Category: Article
ISSN: 0179-5376
DOI: 10.1007/s00454-011-9391-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An asymptotically tight bound on the num

An asymptotically tight bound on the number of semi-algebraically connected components of realizable sign conditions

✍ Saugata Basu; Richard Pollack; Marie-Françoise Roy 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 536 KB

Bounds on the signed domination number o

Bounds on the signed domination number of a graph

✍ Ruth Haas; Thomas B. Wexler 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 387 KB

Bounds on the bondage number of a graph

✍ Bert L. Hartnell; Douglas F. Rall 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 317 KB

The bondage number b(G) of a graph G is the minimum cardinality of a set of edges of G whose removal from G results in a graph with domination number larger than that of G. Several new sharp upper bounds for b(G) are established. In addition, we present an infinite class of graphs each of whose bond

Bounds on the -domination number of a gr

Bounds on the -domination number of a graph

✍ Ermelinda DeLaViña; Wayne Goddard; Michael A. Henning; Ryan Pepper; Emil R. Vaug 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 200 KB

The k-domination number of a graph is the cardinality of a smallest set of vertices such that every vertex not in the set is adjacent to at least k vertices of the set. We prove two bounds on the k-domination number of a graph, inspired by two conjectures of the computer program Graffiti.pc. In part

A bound on the plurigenera of projective

A bound on the plurigenera of projective varieties

✍ Vincenzo Di Gennaro 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 136 KB

We exhibit a sharp Castelnuovo bound for the i-th plurigenus of a smooth variety of given dimension n and degree d in the projective space P r , and classify the varieties attaining the bound, when n2, r2n+1, d>>r and i>>r. When n=2 and r=5, or n=3 and r=7, we give a complete classification, i.e. fo

Tight bounds on the chromatic sum of a c

Tight bounds on the chromatic sum of a connected graph

✍ Carsten Thomassen; Paul Erdös; Yousef Alavi; Paresh J. Malde; Allen J. Schwenk 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 236 KB 👁 1 views