𝔖 Bobbio Scriptorium
✦   LIBER   ✦

OLD AND NEW PROBLEMS IN COMBINATORIAL ANALYSIS AND GRAPH THEORY

✍ Scribed by P. Erdös

Book ID
118717653
Publisher
John Wiley and Sons
Year
1979
Tongue
English
Weight
609 KB
Volume
319
Category
Article
ISSN
0890-6564

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Problems and results in combinatorial an
Problems and results in combinatorial analysis and graph theory
✍ Paul Erd'́os 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 764 KB

I wrote many papers with this and similar titles. In my lecture I stated several of my old solved and unsolved problems some of which have already been published elsewhere. To avoid overlap as much as possible, I state here only relatively new problems. First I state two recent problems of Nesetril

Extremal problems in graph theory
Extremal problems in graph theory
✍ Béla Bollobás 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 304 KB

## Abstract The aim of this note is to give an account of some recent results and state a number of conjectures concerning extremal properties of graphs.

Some problems in topological graph theor
Some problems in topological graph theory
✍ Jonathan L. Gross; Frank Harary 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 504 KB

## Abstract A list of 31 problems presented here reflects some of the main trends in topological graph theory.

Some recent problems and results in grap
Some recent problems and results in graph theory
✍ Paul Erdös 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 230 KB

I will mention two of my favourite problems in which recently important progress was made. The other questions I will mention are perhaps less well known. 1. Faber, Lowisz and I conjectured more than 20 years ago that if Gi, 1 <<.i~n are n G n edge disjoint complete graphs of size n then Ui=l i has