✦ LIBER ✦

Lower Bounds for Kernelizations and

✍ Scribed by Yijia Chen; Jörg Flum; Moritz Müller

Publisher: Springer
Year: 2010
Tongue: English
Weight: 1011 KB
Volume: 48
Category: Article
ISSN: 1433-0490
DOI: 10.1007/s00224-010-9270-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A lower bound for the heat kernel

✍ Jeff Cheeger; Shing-Tung Yau 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 579 KB

Institute for Advanced Study ## 0. Introduction In this note we give an estimate from below for the fundamental solution of the heat equation on an open metric ball BR(x), of radius R, in a Riemannian manifold M". We assume that, for all r < R, B,(x) is compact. The estimate is in the form of a co

A universal lower bound for the kernel e

A universal lower bound for the kernel estimate

✍ Luc Devroye 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 274 KB

Obtaining upper bounds of heat kernels f

Obtaining upper bounds of heat kernels from lower bounds

✍ Alexander Grigor′yan; Jiaxin Hu; Ka-Sing Lau 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 188 KB

## Abstract We show that a __near‐diagonal lower__ bound of the heat kernel of a Dirichlet form on a metric measure space with a regular measure implies an __on‐diagonal__ upper bound. If in addition the Dirichlet form is local and regular, then we obtain a __full off‐diagonal upper__ bound of the

Upper and lower bounds of the kernel and

Upper and lower bounds of the kernel and nucleolus

✍ Y. Funaki 📂 Article 📅 1986 🏛 Springer-Verlag 🌐 English ⚖ 367 KB

Lower bounds for lower Ramsey numbers

✍ Ralph Faudree; Ronald J. Gould; Michael S. Jacobson; Linda Lesniak 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 310 KB 👁 1 views

## Abstract For any graph __G__, let __i__(__G__) and μ;(__G__) denote the smallest number of vertices in a maximal independent set and maximal clique, respectively. For positive integers __m__ and __n__, the lower Ramsey number __s__(__m, n__) is the largest integer __p__ so that every graph of or

Lower bounds and upper bounds for chroma

Lower bounds and upper bounds for chromatic polynomials

✍ Klaus Dohmen 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 204 KB

## Abstract In this paper we give lower bounds and upper bounds for chromatic polynomials of simple undirected graphs on __n__ vertices having __m__ edges and girth exceeding __g__ © 1993 John Wiley & Sons, Inc.