A weighted regularity lemma with applications

DOI10.1155/2014/602657zbMath1295.05208arXiv0907.0245OpenAlexW2156482443WikidataQ59043558 ScholiaQ59043558MaRDI QIDQ2248728

András Pluhár, Béla Csaba

Publication date: 27 June 2014

Published in: International Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0907.0245

zbMATH Keywords

Erdős-Stone theoremsparse regularity lemmaweighted regularity

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Signed and weighted graphs (05C22)

Related Items (3)

Testing graphs against an unknown distribution ⋮ Average Gromov hyperbolicity and the Parisi ansatz ⋮ A weighted regularity lemma with applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A weighted regularity lemma with applications
• Extremal results in sparse pseudorandom graphs
• Szemerédi's Regularity Lemma for Matrices and Sparse Graphs
• Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions
• Turán problems for integer-weighted graphs
• Szemerédi’s Regularity Lemma for Sparse Graphs
• [https://portal.mardi4nfdi.de/wiki/Publication:4351314 A weighted generalization of Tur�n's theorem]
• The Average Distance in a Random Graph with Given Expected Degrees
• Arithmetic progressions of length three in subsets of a random set

This page was built for publication: A weighted regularity lemma with applications