๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An improved bound for the stepping-up lemma

โœ Scribed by Conlon, David; Fox, Jacob; Sudakov, Benny


Book ID
123193801
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
207 KB
Volume
161
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


An algorithmic version of the blow-up le
โœ Jรกnos Komlรณs; Gabor N. Sarkozy; Endre Szemerรฉdi ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 210 KB ๐Ÿ‘ 1 views

Recently we developed a new method in graph theory based on the regularity lemma. The method is applied to find certain spanning subgraphs in dense graphs. The other main general tool of the method, besides the regularity lemma, is the so-called blow-up ลฝ w ลฝ .x lemma Komlos, Sarkozy, and Szemeredi