✦ LIBER ✦

An extremal problem for convolution inequalities

✍ Scribed by M.B Subrahmanyam

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 300 KB
Volume: 87
Category: Article
ISSN: 0022-247X
DOI: 10.1016/0022-247x(82)90140-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An extremal eigenvalue problem

✍ T. J. Mahar; B. E. Willner 📂 Article 📅 1976 🏛 John Wiley and Sons 🌐 English ⚖ 436 KB

An extremal bandwidth problem for bipart

An extremal bandwidth problem for bipartite graphs

✍ Robert C. Brigham; Julie R. Carrington; Ronald D. Dutton; Joseph Fiedler; Richar 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 119 KB 👁 2 views

An extremal problem for subdivisions ofK

An extremal problem for subdivisions ofK?5

✍ Mader, W. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 248 KB 👁 1 views

It is proved that every graph G with G ≥ 2|G| -5, |G| ≥ 6, and girth at least 5, except the Petersen graph, contains a subdivision of K - 5 , the complete graph on five vertices minus one edge.

An extremal problem for H-linked graphs

✍ Alexandr Kostochka; Gexin Yu 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 167 KB 👁 1 views

## Abstract We introduce the notion of __H__‐linked graphs, where __H__ is a fixed multigraph with vertices __w__~1~,…,__w__~m~. A graph __G__ is __H__‐__linked__ if for every choice of vertices υ~1~,…, υ~m~ in __G__, there exists a subdivision of __H__ in __G__ such that υ~i~ is the branch vertex

On an Extremal Problem for Colored Trees

✍ P. Valtr 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 93 KB

Let T be a tree such that there is a proper n-coloring c of the vertices of T which, besides a technical condition, is a k b k a k -free, i.e., T contains no subdivision of a path u 1 , . . . , Then T has O(kn) vertices. (The technical condition requires that T contains no subdivision of a properly

An extremal problem for least common mul

An extremal problem for least common multiples

✍ Melvyn B Nathanson 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 482 KB

Let A be a set of natural numbers, and let [A] h denote the set of all least common multiples [al .... , ah] with ai ~ A. If n ¢ [A] h for all sufficiently large integers n, then A is an asymptotic LCM basis of order h. If n ¢ [A] h for infinitely many n t> 1, then A is an asymptotic LCM nonbasis of