Abstract

Extremal graph theory has a great number of conjectures concerning the embedding of large sparse graphs into dense graphs. Szemerdi's Regularity Lemma is a valuable tool in finding embeddings of sm...

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call