✦ LIBER ✦

Improving an upper bound on the size ofk-regular induced subgraphs

✍ Scribed by Carlos J. Luz

Publisher: Springer US
Year: 2010
Tongue: English
Weight: 469 KB
Volume: 22
Category: Article
ISSN: 1382-6905
DOI: 10.1007/s10878-010-9345-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Spectral upper bounds for the order of a

Spectral upper bounds for the order of a k-regular induced subgraph

✍ Domingos M. Cardoso; Peter Rowlinson 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 136 KB

An Upper Bound on the Average Size of Si

An Upper Bound on the Average Size of Silhouettes

✍ M. Glisse; S. Lazard 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 619 KB

Improving an Upper Bound on the Stabilit

Improving an Upper Bound on the Stability Number of a Graph

✍ Carlos J. Luz 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 494 KB

An improved upper bound on the non-3-col

An improved upper bound on the non-3-colourability threshold

✍ Paul E. Dunne; Michele Zito 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 470 KB

In this paper we derive an improved upper bound on the average vertex degree, 6. needed to ensure that: Vc > 0 and n sufficiently large, a random n-vertex graph with at least (6 + E)&! edges is almost certainly not 3-colourable. @

An upper bound on the size of the snake-

An upper bound on the size of the snake-in-the-box

✍ Gilles Zémor 📂 Article 📅 1997 🏛 Springer-Verlag 🌐 English ⚖ 455 KB

An improved upper bound on the crossing

An improved upper bound on the crossing number of the hypercube

✍ Luerbio Faria; Celina Miraglia Herrera de Figueiredo; Ondrej Sýkora; Imrich Vrt' 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 288 KB

## Abstract We draw the __n__‐dimensional hypercube in the plane with ${5\over 32}4^{n}-\lfloor{{{{n}^{2}+1}\over 2}}\rfloor {2}^{n-2}$ crossings, which improves the previous best estimation and coincides with the long conjectured upper bound of Erdös and Guy. © 2008 Wiley Periodicals, Inc. J Graph