A Weighted Regularity Lemma with Applications

We prove an extension of the regularity lemma with vertex and edge weights which in principle can be applied for arbitrary graphs. The applications involve random graphs and a weighted version of the Erdős-Stone theorem. We also provide means to handle the otherwise uncontrolled exceptional set.

Elmentve itt :
Bibliográfiai részletek
Szerzők: Csaba Béla
Pluhár András
Dokumentumtípus: Cikk
Megjelent: 2014
Sorozat:INTERNATIONAL JOURNAL OF COMBINATORICS 2014
doi:10.1155/2014/602657

mtmt:2604554
Online Access:http://publicatio.bibl.u-szeged.hu/18972
LEADER 01008nab a2200217 i 4500
001 publ18972
005 20200617133002.0
008 200617s2014 hu o 0|| zxx d
022 |a 1687-9163 
024 7 |a 10.1155/2014/602657  |2 doi 
024 7 |a 2604554  |2 mtmt 
040 |a SZTE Publicatio Repozitórium  |b hun 
041 |a zxx 
100 1 |a Csaba Béla 
245 1 2 |a A Weighted Regularity Lemma with Applications  |h [elektronikus dokumentum] /  |c  Csaba Béla 
260 |c 2014 
300 |a Azonosító: 602657-Terjedelem: 9 p 
490 0 |a INTERNATIONAL JOURNAL OF COMBINATORICS  |v 2014 
520 3 |a We prove an extension of the regularity lemma with vertex and edge weights which in principle can be applied for arbitrary graphs. The applications involve random graphs and a weighted version of the Erdős-Stone theorem. We also provide means to handle the otherwise uncontrolled exceptional set. 
700 0 1 |a Pluhár András  |e aut 
856 4 0 |u http://publicatio.bibl.u-szeged.hu/18972/1/602657.pdf  |z Dokumentum-elérés