𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Problems and results in extremal combinatorics—I

✍ Scribed by Noga Alon

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
319 KB
Volume
273
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

Extremal combinatorics is an area in discrete mathematics that has developed spectacularly during the last decades. This paper contains a collection of problems and results in the area, including solutions or partial solutions to open problems suggested by various researchers in extremal graph theory, extremal ÿnite set theory and combinatorial geometry. This is not meant to be a comprehensive survey of the area, it is merely a collection of various extremal problems, which are hopefully interesting. The choice of the problems is inevitably somewhat biased, and as the title of the paper suggests I hope to write a related paper in the future. Each section of this paper is essentially self contained, and can be read separately.

📜 SIMILAR VOLUMES

Extremal results for rooted minor proble
Extremal results for rooted minor problems
✍ Leif K Jørgensen; Ken-ichi Kawarabayashi 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 202 KB

## Abstract In this article, we consider the following problem. Given four distinct vertices __v__~1~,__v__~2~,__v__~3~,__v__~4~. How many edges guarantee the existence of seven connected disjoint subgraphs __X__~i~ for __i__ = 1,…, 7 such that __X__~j~ contains __v__~j~ for __j__ = 1, 2, 3, 4 and

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.