𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Independent finite sums in graphs defined on the natural numbers

✍ Scribed by Tomasz Luczak; Vojtěch Rödl; Tomasz Schoen

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
281 KB
Volume
181
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Independent Arithmetic Progressions in C
Independent Arithmetic Progressions in Clique-Free Graphs on the Natural Numbers
✍ David S. Gunderson; Imre Leader; Hans Jürgen Prömel; Vojtěch Rödl 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 179 KB

We show that if G is a K r -free graph on N, there is an independent set in G which contains an arbitrarily long arithmetic progression together with its difference. This is a common generalization of theorems of Schur, van der Waerden, and Ramsey. We also discuss various related questions regarding

On the Number of Slopes of the Graph of
On the Number of Slopes of the Graph of a Function Defined on a Finite Field
✍ A. Blokhuis; S. Ball; A.E. Brouwer; L. Storme; T. Szőnyi 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 116 KB

Given a set U of size q in an affine plane of order q, we determine the possibilities for the number of directions of secants of U, and in many cases characterize the sets U with given number of secant directions.

Constraints on the number of maximal ind
Constraints on the number of maximal independent sets in graphs
✍ Jiuqiang Liu 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 387 KB 👁 2 views

## Abstract A maximal independent set of a graph __G__ is an independent set that is not contained properly in any other independent set of __G__. Let __i(G)__ denote the number of maximal independent sets of __G__. Here, we prove two conjectures, suggested by P. Erdös, that the maximum number of m

On the Maximum Number of Independent Cyc
On the Maximum Number of Independent Cycles in a Bipartite Graph
✍ Hong Wang 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 404 KB

Let G=(V 1 , V 2 ; E ) be a bipartite graph with |V 1 |= |V 2 | =n 2k, where k is a positive integer. Suppose that the minimum degree of G is at least k+1. We show that if n>2k, then G contains k vertex-disjoint cycles. We also show that if n=2k, then G contains k&1 quadrilaterals and a path of orde

On the independence number in K1, r+1-fr
On the independence number in K1, r+1-free graphs
✍ Zdeněk Ryjáček; Ingo Schiermeyer 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 353 KB

In this paper we use the degree sequence, order, size and vertex connectivity of a K 1,,+ 1 -free graph or of an almost claw-free graph to obtain several upper bounds on its independence number. We also discuss the sharpness of these results.