𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A weighted Turán sieve method

✍ Scribed by Yu-Ru Liu; M. Ram Murty

Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
185 KB
Volume
116
Category
Article
ISSN
0022-314X

No coin nor oath required. For personal study only.

✦ Synopsis

We develop a weighted Turán sieve method and applied it to study the number of distinct prime divisors of f (p) where p is a prime and f (x) a polynomial with integer coefficients.

📜 SIMILAR VOLUMES

Turán problems for integer-weighted grap
Turán problems for integer-weighted graphs
✍ Zoltán Füredi; André Kündgen 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 238 KB

## Abstract A multigraph is (__k__,__r__)‐dense if every __k__‐set spans at most __r__ edges. What is the maximum number of edges ex~ℕ~(__n__,__k__,__r__) in a (__k__,__r__)‐dense multigraph on __n__ vertices? We determine the maximum possible weight of such graphs for almost all __k__ and __r__ (e

On Turán Quadrature Formulas for the Che
On Turán Quadrature Formulas for the Chebyshev Weight
✍ Guang Shi Ying 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 107 KB

As we know, the Chebyshev weight w(x)=(1&x 2 ) &1Â2 has the property: For each fixed n, the solutions of the extremal problem dx for every even m are the same. This paper proves that the Chebyshev weight is the only weight having this property (up to a linear transformation).

A weighted generalization of Tur�n's the
A weighted generalization of Tur�n's theorem
✍ Bondy, J. A.; Tuza, Zs. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 114 KB 👁 2 views

We obtain a generalization of Turán's theorem for graphs whose edges are assigned integer weights. We also characterize the extremal graphs in certain cases.

A generalization of Turán's theorem
A generalization of Turán's theorem
✍ Benny Sudakov; Tibor Szabó; H. Van Vu 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 94 KB

## Abstract In this paper, we obtain an asymptotic generalization of Turán's theorem. We prove that if all the non‐trivial eigenvalues of a __d__‐regular graph __G__ on __n__ vertices are sufficiently small, then the largest __K__~__t__~‐free subgraph of __G__ contains approximately (__t__ − 2)/(__

On a Ramsey-Turán type problem
On a Ramsey-Turán type problem
✍ Béla Bollobás; Paul Erdös 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 128 KB