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
✦ LIBER ✦
Blow-up Lemma
✍ Scribed by János Komlós; Gábor N. Sárközy; Endre Szemerédi
- Publisher
- Springer-Verlag
- Year
- 1997
- Tongue
- English
- Weight
- 709 KB
- Volume
- 17
- Category
- Article
- ISSN
- 0209-9683
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
Perfect Matchings in ε-Regular Graphs an
✍
Vojtech Rödl; Andrzej Ruciński
📂
Article
📅
1999
🏛
Springer-Verlag
🌐
English
⚖ 278 KB
Blowing Up Russia
✍
Litvinenko, Alexander
📂
Fiction
📅
0
🌐
English
⚖ 198 KB
✍
ABC Amber Sony Converter
📂
Fiction
📅
0
🌐
English
⚖ 211 KB
✍
Townsdin, Linda
📂
Fiction
📅
2017
🌐
English
⚖ 146 KB
👁 2 views
Photojournalist Britt Johansson has returned to Spirit Lake, Minnesota, to heal from stress and anxiety after covering an explosion in a Nigerian marketplace, her recent assignment for the LA Times. But when a bomb at the nearby college kills one student and badly injures a young woman who means a l
Noetherian symbolic blow-ups
✍
Marcel Morales
📂
Article
📅
1991
🏛
Elsevier Science
🌐
English
⚖ 654 KB